java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:12:53,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:12:53,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:12:53,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:12:53,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:12:53,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:12:53,325 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:12:53,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:12:53,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:12:53,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:12:53,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:12:53,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:12:53,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:12:53,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:12:53,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:12:53,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:12:53,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:12:53,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:12:53,343 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:12:53,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:12:53,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:12:53,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:12:53,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:12:53,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:12:53,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:12:53,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:12:53,355 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:12:53,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:12:53,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:12:53,359 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:12:53,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:12:53,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:12:53,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:12:53,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:12:53,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:12:53,364 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:12:53,364 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:12:53,386 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:12:53,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:12:53,388 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:12:53,388 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:12:53,388 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:12:53,389 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:12:53,389 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:12:53,389 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:12:53,389 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:12:53,389 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:12:53,390 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:12:53,390 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:12:53,390 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:12:53,390 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:12:53,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:12:53,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:12:53,391 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:12:53,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:12:53,393 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:12:53,393 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:12:53,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:12:53,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:12:53,393 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:12:53,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:12:53,394 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:12:53,394 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:12:53,394 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:12:53,394 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:12:53,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:12:53,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:12:53,395 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:12:53,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:12:53,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:12:53,395 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:12:53,396 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:12:53,396 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:12:53,396 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:12:53,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:12:53,396 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:12:53,397 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:12:53,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:12:53,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:12:53,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:12:53,474 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:12:53,474 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:12:53,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-11 11:12:53,476 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-11 11:12:53,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:12:53,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:12:53,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:12:53,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:12:53,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:12:53,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:12:53,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:12:53,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:12:53,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:12:53,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... [2019-01-11 11:12:53,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:12:53,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:12:53,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:12:53,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:12:53,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:12:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:12:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:12:54,008 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:12:54,008 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-11 11:12:54,010 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:12:54 BoogieIcfgContainer [2019-01-11 11:12:54,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:12:54,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:12:54,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:12:54,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:12:54,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:12:53" (1/2) ... [2019-01-11 11:12:54,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a83d4 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:12:54, skipping insertion in model container [2019-01-11 11:12:54,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:12:54" (2/2) ... [2019-01-11 11:12:54,026 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-11 11:12:54,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:12:54,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-11 11:12:54,064 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-11 11:12:54,095 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:12:54,096 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:12:54,096 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:12:54,096 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:12:54,096 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:12:54,096 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:12:54,097 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:12:54,097 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:12:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 11:12:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:12:54,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:54,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:12:54,121 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-11 11:12:54,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:54,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:54,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:54,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:54,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:54,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:12:54,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:12:54,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:12:54,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:12:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:12:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:12:54,323 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-11 11:12:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:54,530 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-11 11:12:54,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:12:54,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:12:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:54,545 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:12:54,545 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:12:54,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:12:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:12:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-11 11:12:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:12:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-11 11:12:54,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-11 11:12:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:54,579 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-11 11:12:54,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:12:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-11 11:12:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:12:54,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:54,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:12:54,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-11 11:12:54,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:54,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:54,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:54,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:54,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:54,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:54,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:54,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:12:54,744 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-11 11:12:54,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:12:54,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:12:54,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:12:54,886 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:12:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:54,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:12:54,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:54,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:54,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:54,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:55,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:12:55,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:12:55,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:12:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:12:55,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:12:55,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:55,326 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:55,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:55,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:55,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:55,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:55,834 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:12:55,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:55,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:12:55,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:56,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:56,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:12:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:56,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:56,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:56,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:12:56,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:56,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:12:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:12:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:12:56,199 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-11 11:12:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:56,913 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-11 11:12:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:12:56,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:12:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:56,916 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:12:56,916 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:12:56,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:12:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:12:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-11 11:12:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:12:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-11 11:12:56,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-11 11:12:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:56,924 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-11 11:12:56,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:12:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-11 11:12:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:12:56,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:56,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:12:56,926 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:56,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:56,926 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-11 11:12:56,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:56,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:57,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:57,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:57,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:12:57,060 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-11 11:12:57,062 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:12:57,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:12:57,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:12:57,071 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:12:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:57,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:12:57,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:57,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:57,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:57,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:57,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:57,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:12:57,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:12:57,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:12:57,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:12:57,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:12:57,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:57,307 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:57,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:57,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:57,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:57,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:57,385 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:12:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:12:57,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:57,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:57,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:12:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:57,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:57,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:12:57,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:12:57,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:12:57,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:12:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:12:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:12:57,600 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-11 11:12:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:57,703 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-11 11:12:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:12:57,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:12:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:57,706 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:12:57,706 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:12:57,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:12:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:12:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:12:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:12:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-11 11:12:57,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-11 11:12:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:57,711 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-11 11:12:57,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:12:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-11 11:12:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:12:57,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:57,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:12:57,712 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-11 11:12:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:57,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:57,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:57,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:57,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:12:57,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:12:57,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:12:57,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:12:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:12:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:12:57,761 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-11 11:12:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:57,805 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-11 11:12:57,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:12:57,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:12:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:57,806 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:12:57,806 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:12:57,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:12:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:12:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-11 11:12:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:12:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-11 11:12:57,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-11 11:12:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:57,812 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-11 11:12:57,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:12:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-11 11:12:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:12:57,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:57,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:12:57,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-11 11:12:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:57,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:57,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:57,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:57,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:57,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:12:57,948 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-11 11:12:57,950 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:12:57,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:12:57,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:12:57,958 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:12:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:57,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:12:57,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:57,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:57,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:57,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:57,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:12:57,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:12:57,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:57,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:12:58,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:12:58,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:12:58,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:58,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:58,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:58,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:58,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:58,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:58,168 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:12:58,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:12:58,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:58,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:58,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:12:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:58,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:58,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:58,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:12:58,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:58,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:12:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:12:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:12:58,399 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-11 11:12:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:58,646 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-11 11:12:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:12:58,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:12:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:58,651 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:12:58,651 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 11:12:58,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:12:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 11:12:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-11 11:12:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:12:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-11 11:12:58,659 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-11 11:12:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:58,659 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-11 11:12:58,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:12:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-11 11:12:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:12:58,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:58,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:12:58,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:58,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-11 11:12:58,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:58,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:58,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:58,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:58,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:58,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:12:58,841 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-11 11:12:58,845 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:12:58,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:12:58,852 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:12:58,852 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:12:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:58,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:12:58,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:58,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:58,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:58,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:58,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:58,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:12:58,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:12:58,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:12:58,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:58,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:12:58,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,052 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-11 11:12:59,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:12:59,054 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:59,148 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:12:59,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:12:59,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:59,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:12:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:12:59,366 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-11 11:12:59,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:12:59,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:12:59,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:12:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:59,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:59,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:59,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:12:59,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:59,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:12:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:12:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:12:59,504 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-11 11:13:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:00,077 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-11 11:13:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:00,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:00,079 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:13:00,079 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:13:00,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:13:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-11 11:13:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 11:13:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-11 11:13:00,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-11 11:13:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:00,087 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-11 11:13:00,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-11 11:13:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:00,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:00,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:00,087 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-11 11:13:00,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:00,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:00,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:00,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:00,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:00,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:00,229 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-11 11:13:00,233 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:00,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:00,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:00,240 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:00,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:00,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:00,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:00,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:00,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:00,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:00,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:00,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:00,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:00,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:00,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:00,401 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:00,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:00,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:00,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:00,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:00,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:00,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:00,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:00,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:00,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:01,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:01,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:01,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:01,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:01,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:01,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:01,037 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-11 11:13:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:01,451 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-11 11:13:01,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:01,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:01,452 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:13:01,452 INFO L226 Difference]: Without dead ends: 46 [2019-01-11 11:13:01,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-11 11:13:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-11 11:13:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:13:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-11 11:13:01,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-11 11:13:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:01,460 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-11 11:13:01,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-11 11:13:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:01,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:01,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:01,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-11 11:13:01,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:01,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:01,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:01,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:01,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:01,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:01,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:01,524 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-11 11:13:01,526 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:01,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:01,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:01,537 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:01,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:01,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:01,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:01,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:01,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:01,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:01,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:01,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:01,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:01,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:01,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:01,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:01,708 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:01,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:01,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:13:01,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:01,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:01,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:01,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:01,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:13:01,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:01,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:01,829 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-11 11:13:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:01,977 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-11 11:13:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:01,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:13:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:01,978 INFO L225 Difference]: With dead ends: 28 [2019-01-11 11:13:01,978 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 11:13:01,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 11:13:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-11 11:13:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:13:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-11 11:13:01,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-11 11:13:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:01,985 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-11 11:13:01,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-11 11:13:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:01,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:01,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:01,986 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-11 11:13:01,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:01,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:01,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:02,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:02,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:02,104 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:02,104 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-11 11:13:02,106 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:02,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:02,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:02,112 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:02,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:02,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:02,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:02,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:02,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:02,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:02,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:02,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:02,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:02,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:02,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:02,285 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:02,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:02,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:02,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:02,425 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:02,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:13:02,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:02,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:02,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:02,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:02,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:02,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:02,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:02,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:02,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:02,539 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-11 11:13:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:02,967 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-11 11:13:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:02,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:02,969 INFO L225 Difference]: With dead ends: 44 [2019-01-11 11:13:02,969 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 11:13:02,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 11:13:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-11 11:13:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:13:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-11 11:13:02,977 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-11 11:13:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:02,977 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-11 11:13:02,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-11 11:13:02,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:02,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:02,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:02,978 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:02,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:02,978 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-11 11:13:02,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:02,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:02,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:02,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:02,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:03,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:03,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:03,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:03,078 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-11 11:13:03,079 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:03,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:03,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:03,085 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:03,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:03,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:03,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:03,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:03,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:03,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:03,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:03,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:03,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:03,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:03,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:03,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:03,235 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:03,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:03,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:03,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:03,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:03,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-01-11 11:13:03,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:03,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:03,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:03,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:03,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:03,348 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-11 11:13:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:03,591 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-11 11:13:03,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:03,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:03,592 INFO L225 Difference]: With dead ends: 43 [2019-01-11 11:13:03,592 INFO L226 Difference]: Without dead ends: 42 [2019-01-11 11:13:03,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-11 11:13:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-11 11:13:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:13:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-11 11:13:03,600 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-11 11:13:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:03,600 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-11 11:13:03,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-11 11:13:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:03,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:03,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:03,602 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-11 11:13:03,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:03,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:03,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:03,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:03,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:03,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:03,741 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-11 11:13:03,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:03,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:03,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:03,748 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:03,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:03,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:03,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:03,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:03,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:03,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:03,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:03,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:03,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:03,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:03,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:03,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:03,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:03,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:03,928 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:04,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:04,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:04,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:04,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:04,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:04,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:04,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:04,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:04,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:04,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:04,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:04,326 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-11 11:13:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:04,756 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-11 11:13:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:04,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:04,758 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:13:04,759 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:04,759 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-01-11 11:13:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-11 11:13:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 11:13:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-11 11:13:04,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-11 11:13:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:04,768 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-11 11:13:04,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-11 11:13:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:04,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:04,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:04,769 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-11 11:13:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:04,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:04,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:04,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:04,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:04,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:04,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:04,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:04,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:04,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:04,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:13:04,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:04,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:04,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:04,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:04,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:04,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:04,906 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:04,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:04,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:04,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:04,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:05,001 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:05,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:05,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:05,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:05,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:13:05,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:05,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:05,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:05,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:05,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:05,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:05,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:05,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:05,369 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-11 11:13:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:05,743 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-11 11:13:05,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:05,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:05,745 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:13:05,745 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 11:13:05,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-01-11 11:13:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 11:13:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-11 11:13:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:13:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-11 11:13:05,755 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-11 11:13:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:05,755 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-11 11:13:05,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-11 11:13:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:05,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:05,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:05,756 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-11 11:13:05,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:05,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:05,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:05,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:05,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:05,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:05,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:05,822 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-11 11:13:05,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:05,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:05,830 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:05,830 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:05,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:05,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:05,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:05,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:05,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:05,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:05,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:05,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:05,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:05,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:05,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:05,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:05,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:06,001 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:06,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:06,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:06,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:06,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:06,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:06,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:06,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:06,129 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-11 11:13:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:06,315 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-11 11:13:06,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:06,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:06,316 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:13:06,317 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:13:06,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:13:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-11 11:13:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:13:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-11 11:13:06,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-11 11:13:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:06,326 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-11 11:13:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-11 11:13:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:06,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:06,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:06,328 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-11 11:13:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:06,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:06,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:13:06,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:06,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:13:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:13:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:06,369 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-11 11:13:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:06,409 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-11 11:13:06,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:06,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 11:13:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:06,410 INFO L225 Difference]: With dead ends: 34 [2019-01-11 11:13:06,410 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 11:13:06,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 11:13:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 11:13:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:13:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-11 11:13:06,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-11 11:13:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:06,420 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-11 11:13:06,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:13:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-11 11:13:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:06,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:06,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:06,421 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-11 11:13:06,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:06,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:06,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:06,681 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-11 11:13:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:06,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:06,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:06,689 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:06,689 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-11 11:13:06,690 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:06,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:06,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:06,695 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:06,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:06,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:06,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:06,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:06,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:06,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:06,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:06,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:06,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:06,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:06,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:06,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:06,861 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:06,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:06,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:06,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:06,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:06,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:06,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:06,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:07,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:07,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:07,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:07,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:07,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:07,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:07,095 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-11 11:13:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:07,471 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-11 11:13:07,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:07,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:07,476 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:13:07,476 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:13:07,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:13:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-11 11:13:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 11:13:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-11 11:13:07,485 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-11 11:13:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:07,486 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-11 11:13:07,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-11 11:13:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:07,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:07,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:07,487 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-11 11:13:07,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:07,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:07,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:07,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:07,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:07,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:07,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:07,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:07,577 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-11 11:13:07,578 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:07,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:07,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:07,583 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:07,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:07,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:07,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:07,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:07,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:07,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:07,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:07,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:07,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:07,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:07,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:07,649 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:07,722 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:07,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:07,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:07,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:07,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:07,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:07,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:07,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:07,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:07,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:07,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:07,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:07,827 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-11 11:13:08,279 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-11 11:13:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:08,678 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-11 11:13:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:08,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:08,680 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:13:08,680 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 11:13:08,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 11:13:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-11 11:13:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 11:13:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-11 11:13:08,691 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-11 11:13:08,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:08,691 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-11 11:13:08,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-11 11:13:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:08,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:08,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:08,692 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-11 11:13:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:08,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:08,893 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 11:13:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:08,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:08,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:08,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:08,919 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-11 11:13:08,920 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:08,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:08,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:08,925 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:08,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:08,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:08,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:08,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:08,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:08,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:08,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:08,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:08,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:08,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:08,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:08,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:09,098 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:09,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:09,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:09,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:09,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:09,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:09,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:09,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:09,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:09,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:09,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:09,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:09,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:09,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:09,475 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-11 11:13:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:09,976 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-11 11:13:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:09,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:09,977 INFO L225 Difference]: With dead ends: 64 [2019-01-11 11:13:09,977 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 11:13:09,978 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-01-11 11:13:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 11:13:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-11 11:13:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:13:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-11 11:13:09,988 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-11 11:13:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:09,988 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-11 11:13:09,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-11 11:13:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:09,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:09,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:09,990 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-11 11:13:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:09,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:09,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:10,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:10,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:10,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:10,088 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-11 11:13:10,089 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:10,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:10,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:10,093 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:10,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:10,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:10,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:10,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:10,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:10,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:10,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:10,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:10,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:10,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:10,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:10,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:10,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:10,236 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:10,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:13:10,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:10,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:10,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:10,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:13:10,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:10,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:10,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:13:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:10,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:10,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:10,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:10,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:10,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:10,473 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-11 11:13:10,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:10,794 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-11 11:13:10,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:10,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:10,796 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:13:10,796 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 11:13:10,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 11:13:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-11 11:13:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:13:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-11 11:13:10,808 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-11 11:13:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:10,808 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-11 11:13:10,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-11 11:13:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:10,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:10,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:10,810 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-11 11:13:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:10,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:10,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:10,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:10,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:10,962 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-11 11:13:10,963 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:10,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:10,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:10,969 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:10,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:10,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:10,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:10,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:10,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:10,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:11,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:11,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:11,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:11,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:11,121 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:11,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:11,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:11,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:11,422 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 11:13:11,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,539 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-11 11:13:11,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:13:11,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:11,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:11,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:11,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:11,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:11,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:13:11,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:12,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:12,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:12,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:12,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:12,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:12,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:12,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:12,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:12,181 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-11 11:13:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:13,203 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-11 11:13:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:13,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:13,204 INFO L225 Difference]: With dead ends: 68 [2019-01-11 11:13:13,204 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 11:13:13,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 11:13:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-11 11:13:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:13:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-11 11:13:13,220 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-11 11:13:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:13,220 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-11 11:13:13,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-11 11:13:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:13,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:13,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:13,221 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-11 11:13:13,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:13,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:13,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:13,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:13,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:13,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:13,402 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-11 11:13:13,404 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:13,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:13,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:13,407 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:13,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:13,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:13,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:13,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:13,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:13,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:13,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:13,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:13,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:13,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:13,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:13,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:13,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:13,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:13,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:13,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:13,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:13,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:13,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:13,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-01-11 11:13:13,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:13,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:13,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:13,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:13,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:13,856 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-11 11:13:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:14,262 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-11 11:13:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:14,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:14,263 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:13:14,263 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:14,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-11 11:13:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:13:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-11 11:13:14,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-11 11:13:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:14,275 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-11 11:13:14,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-11 11:13:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:14,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:14,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:14,276 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-11 11:13:14,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:14,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:14,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:14,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:14,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:14,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:14,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:14,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:14,348 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-11 11:13:14,349 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:14,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:14,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:14,354 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:14,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:14,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:14,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:14,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:14,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:14,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:14,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:14,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:14,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:13:14,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:13:14,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:13:14,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:14,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:14,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:14,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:14,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:14,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:14,541 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 11:13:14,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:13:14,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:14,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:14,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:13:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:14,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:14,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:14,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:14,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:14,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:14,660 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-11 11:13:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:14,812 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-11 11:13:14,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:14,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 11:13:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:14,813 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:13:14,814 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:13:14,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:13:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-11 11:13:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:13:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-11 11:13:14,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-11 11:13:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:14,825 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-11 11:13:14,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-11 11:13:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:14,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:14,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:14,826 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-11 11:13:14,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:14,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:14,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:14,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:14,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:14,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:14,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:14,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:14,924 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-11 11:13:14,925 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:14,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:14,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:14,930 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:14,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:14,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:14,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:14,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:14,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:14,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:14,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:14,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:14,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:14,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,050 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:15,085 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:15,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:15,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:15,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,264 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:15,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:13:15,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:15,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:15,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:15,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 11:13:15,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:15,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:15,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:13:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:15,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:15,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:15,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:15,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:15,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:15,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:15,485 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-11 11:13:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:16,107 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-11 11:13:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:16,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:16,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:16,111 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:13:16,111 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 11:13:16,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:13:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 11:13:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-11 11:13:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 11:13:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-11 11:13:16,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-11 11:13:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:16,123 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-11 11:13:16,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-11 11:13:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:16,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:16,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:16,124 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-11 11:13:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:16,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:16,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:16,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:16,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:16,230 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:16,230 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-11 11:13:16,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:16,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:16,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:16,236 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:16,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:16,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:16,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:16,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:16,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:16,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:16,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:16,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:16,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:16,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:16,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,344 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:16,395 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:16,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:13:16,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:16,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:16,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:16,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:13:16,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:16,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:16,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:13:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:16,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:16,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:16,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:16,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:16,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:16,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:16,675 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-11 11:13:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:16,993 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-11 11:13:16,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:16,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:16,994 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:13:16,994 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:13:16,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:13:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-11 11:13:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:13:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-11 11:13:17,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-11 11:13:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:17,007 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-11 11:13:17,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-11 11:13:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:17,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:17,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:17,008 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-11 11:13:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:17,316 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-11 11:13:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:17,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:17,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:17,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:17,343 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-11 11:13:17,344 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:17,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:17,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:17,348 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:17,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:17,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:17,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:17,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:17,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:17,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:17,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:17,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:17,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:17,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:17,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,694 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-11 11:13:17,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:17,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,731 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:17,788 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:17,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:17,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:17,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:17,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:17,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:17,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:17,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:17,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:18,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:13:18,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:18,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:18,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:18,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:18,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:18,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:18,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:18,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:18,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:18,271 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-11 11:13:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:19,036 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-11 11:13:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:19,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:19,037 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:13:19,038 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 11:13:19,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 11:13:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-11 11:13:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:13:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-11 11:13:19,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-11 11:13:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:19,048 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-11 11:13:19,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-11 11:13:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:19,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:19,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:19,049 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-11 11:13:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:19,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:19,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:19,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:19,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:19,154 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:19,154 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-11 11:13:19,156 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:19,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:19,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:19,160 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:19,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:19,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:19,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:19,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:19,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:19,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:19,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:19,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:19,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:19,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:19,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:19,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:19,220 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,248 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:19,316 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:19,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:19,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:19,633 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 11:13:19,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,917 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:19,918 INFO L303 Elim1Store]: Index analysis took 280 ms [2019-01-11 11:13:19,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:19,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:20,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:20,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:20,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:20,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:20,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:20,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:20,862 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-11 11:13:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:21,240 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-11 11:13:21,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:21,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:21,242 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:13:21,242 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:13:21,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:13:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-11 11:13:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:13:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-11 11:13:21,256 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-11 11:13:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:21,256 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-11 11:13:21,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-11 11:13:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:21,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:21,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:21,257 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-11 11:13:21,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:21,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:21,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:21,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:21,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:21,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:21,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:21,449 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-11 11:13:21,450 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:21,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:21,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:21,453 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:21,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:21,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:21,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:21,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:21,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:21,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:21,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:21,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:21,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:21,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:21,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:21,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:21,609 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:21,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:21,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:21,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:21,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,722 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:21,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:21,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:21,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:21,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:21,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:21,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:21,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:21,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:21,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:21,937 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-11 11:13:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:22,558 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-11 11:13:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:22,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:22,560 INFO L225 Difference]: With dead ends: 93 [2019-01-11 11:13:22,560 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 11:13:22,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 11:13:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-11 11:13:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:13:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-11 11:13:22,576 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-11 11:13:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:22,576 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-11 11:13:22,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-11 11:13:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:22,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:22,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:22,577 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-11 11:13:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:22,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:22,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:22,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:22,635 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-11 11:13:22,636 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:22,636 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:22,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:22,639 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:22,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:22,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:22,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:22,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:22,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:22,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:22,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:22,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:22,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:13:22,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:13:22,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:13:22,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:22,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 11:13:22,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:13:22,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:22,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:13:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:22,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:13:22,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:22,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:22,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:22,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:22,874 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-11 11:13:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:22,917 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-11 11:13:22,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:22,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:13:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:22,919 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:13:22,919 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:22,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-11 11:13:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:13:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-11 11:13:22,934 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-11 11:13:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:22,934 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-11 11:13:22,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-11 11:13:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:22,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:22,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:22,935 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-11 11:13:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:22,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:22,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:22,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:22,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:22,996 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-11 11:13:22,997 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:22,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:22,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:23,000 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:23,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:23,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:23,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:23,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:23,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:23,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:23,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:23,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:23,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:23,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:23,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:23,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:23,130 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:24,020 WARN L181 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:13:24,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:24,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:24,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:24,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:13:24,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:24,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:24,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:24,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:24,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:24,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:24,194 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-11 11:13:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:24,594 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-11 11:13:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:24,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:24,596 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:13:24,596 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:13:24,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:13:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-11 11:13:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 11:13:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-11 11:13:24,614 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-11 11:13:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:24,614 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-11 11:13:24,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-11 11:13:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:24,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:24,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:24,615 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:24,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:24,615 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-11 11:13:24,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:24,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:24,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:24,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:24,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:24,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:24,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:24,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:24,829 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-11 11:13:24,829 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:24,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:24,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:24,833 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:24,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:24,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:24,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:24,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:24,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:24,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:24,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:24,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:24,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:24,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:24,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:24,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:24,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:24,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:24,974 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:24,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:25,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:25,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:25,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:25,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:25,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:25,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,178 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:25,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:13:25,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:25,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:25,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:25,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:25,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:25,371 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-11 11:13:26,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:26,134 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-11 11:13:26,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:26,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:26,136 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:13:26,136 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 11:13:26,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 11:13:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-11 11:13:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:13:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-11 11:13:26,153 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-11 11:13:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:26,153 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-11 11:13:26,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-11 11:13:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:26,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:26,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:26,154 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-11 11:13:26,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:26,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:26,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:26,404 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-11 11:13:26,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-01-11 11:13:26,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:26,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:26,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:26,431 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-11 11:13:26,433 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:26,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:26,435 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:26,436 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:26,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:26,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:26,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:26,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:26,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:26,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:26,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:26,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:26,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:26,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:26,493 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:26,561 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:26,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:26,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:26,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:26,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,792 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:26,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 11:13:26,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:26,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:26,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:26,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:26,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:26,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:26,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:26,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:26,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:26,880 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-11 11:13:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:27,203 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-11 11:13:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:27,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:27,205 INFO L225 Difference]: With dead ends: 82 [2019-01-11 11:13:27,205 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 11:13:27,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 11:13:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-11 11:13:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:13:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-11 11:13:27,223 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-11 11:13:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:27,224 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-11 11:13:27,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-11 11:13:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:27,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:27,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:27,225 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:27,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-11 11:13:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:27,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:27,421 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 11:13:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:27,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:27,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:27,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:27,437 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-11 11:13:27,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:27,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:27,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:27,442 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:27,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:27,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:27,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:27,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:27,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:27,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:27,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:27,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:27,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:27,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:27,493 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,524 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:27,585 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:27,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:27,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:27,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:27,777 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-11 11:13:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:27,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:27,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:27,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:27,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:27,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:27,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:27,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:27,920 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-11 11:13:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:28,235 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-11 11:13:28,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:28,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:28,238 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:13:28,238 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 11:13:28,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 11:13:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-11 11:13:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 11:13:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-11 11:13:28,255 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-11 11:13:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:28,256 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-11 11:13:28,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-11 11:13:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:28,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:28,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:28,257 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-11 11:13:28,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:28,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:28,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:28,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:28,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:28,431 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 11:13:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:28,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:28,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:28,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:28,453 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-11 11:13:28,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:28,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:28,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:28,462 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:28,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:28,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:28,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:28,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:28,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:28,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:28,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:28,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:28,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:28,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:28,624 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:28,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:28,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:28,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:28,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:28,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:28,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:28,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:28,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:28,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:28,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:28,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:28,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:28,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:28,842 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-11 11:13:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:29,174 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-11 11:13:29,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:29,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:29,176 INFO L225 Difference]: With dead ends: 86 [2019-01-11 11:13:29,176 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:13:29,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:13:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-11 11:13:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 11:13:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-11 11:13:29,201 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-11 11:13:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:29,201 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-11 11:13:29,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-11 11:13:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:29,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:29,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:29,202 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-11 11:13:29,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:29,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:29,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:29,496 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-11 11:13:29,791 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 11:13:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:29,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:29,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:29,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:29,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:29,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:29,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:29,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:29,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:29,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:13:29,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:29,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:29,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:29,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:30,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:30,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,195 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-11 11:13:30,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:30,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:30,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:30,342 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:30,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:30,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:30,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:30,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:13:30,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:30,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:13:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:30,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:30,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:30,541 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-11 11:13:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:31,345 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-11 11:13:31,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:31,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:31,347 INFO L225 Difference]: With dead ends: 110 [2019-01-11 11:13:31,348 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:13:31,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:13:31,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-11 11:13:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 11:13:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-11 11:13:31,369 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-11 11:13:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:31,369 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-11 11:13:31,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-11 11:13:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:31,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:31,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:31,370 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-11 11:13:31,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:31,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:31,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:31,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:31,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:31,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:31,480 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-11 11:13:31,481 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:31,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:31,484 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:31,484 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:31,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:31,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:31,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:31,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:31,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:31,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:31,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:31,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:31,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:31,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:31,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:31,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,556 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:31,605 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:31,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:31,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:31,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:31,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:31,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:31,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:31,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:31,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:31,715 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-11 11:13:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:31,999 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-11 11:13:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:31,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 11:13:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:32,001 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:13:32,001 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 11:13:32,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 11:13:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-11 11:13:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:13:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-11 11:13:32,023 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-11 11:13:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:32,023 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-11 11:13:32,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-11 11:13:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:32,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:32,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:32,024 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-11 11:13:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:32,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:32,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:32,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:32,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:32,169 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-11 11:13:32,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:32,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:32,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:32,173 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:32,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:32,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:32,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:32,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:32,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:32,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:32,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:32,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:32,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:32,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:32,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:32,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:32,297 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:32,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:32,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:32,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:32,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:32,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:32,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:32,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:32,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:32,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:32,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:32,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:32,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:32,612 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-11 11:13:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:33,177 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-11 11:13:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:33,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:33,180 INFO L225 Difference]: With dead ends: 133 [2019-01-11 11:13:33,180 INFO L226 Difference]: Without dead ends: 132 [2019-01-11 11:13:33,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-11 11:13:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-11 11:13:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:13:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-11 11:13:33,200 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-11 11:13:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:33,201 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-11 11:13:33,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-11 11:13:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:33,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:33,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:33,202 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-11 11:13:33,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:33,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:33,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:33,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:33,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:33,353 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:33,353 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-11 11:13:33,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:33,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:33,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:33,358 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:33,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:33,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:33,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:33,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:33,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:33,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:33,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:33,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:33,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:33,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:33,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:33,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:33,495 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:33,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:33,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:33,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:33,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:13:33,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:33,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:33,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:33,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:33,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:33,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:33,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:33,676 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-11 11:13:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:34,024 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-11 11:13:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:34,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:34,026 INFO L225 Difference]: With dead ends: 113 [2019-01-11 11:13:34,026 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 11:13:34,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 11:13:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-11 11:13:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:13:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-11 11:13:34,051 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-11 11:13:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:34,051 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-11 11:13:34,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-11 11:13:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:34,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:34,052 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:13:34,052 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-11 11:13:34,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:34,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:34,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:34,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:34,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:34,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:34,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:34,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:13:34,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:34,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:34,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:34,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:34,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:34,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:34,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:34,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:34,304 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:34,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:34,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:34,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:34,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-11 11:13:34,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:34,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:34,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:34,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:34,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:34,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-11 11:13:34,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:34,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:34,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:34,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:34,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:13:34,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:34,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:13:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:13:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:34,897 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-11 11:13:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:35,713 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-11 11:13:35,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:35,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:13:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:35,716 INFO L225 Difference]: With dead ends: 136 [2019-01-11 11:13:35,716 INFO L226 Difference]: Without dead ends: 131 [2019-01-11 11:13:35,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:13:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-11 11:13:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-11 11:13:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:13:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 11:13:35,742 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 11:13:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:35,742 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 11:13:35,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:13:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 11:13:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:35,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:35,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:35,743 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-11 11:13:35,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:35,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:35,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:35,903 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-11 11:13:35,904 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:35,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:35,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:35,907 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:35,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:35,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:35,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:35,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:35,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:35,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:35,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:35,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:35,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,015 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:36,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:36,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:36,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:13:36,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:36,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:36,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:13:36,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:36,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:36,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:36,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:36,409 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-11 11:13:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:36,895 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-11 11:13:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:36,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:13:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:36,897 INFO L225 Difference]: With dead ends: 106 [2019-01-11 11:13:36,897 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:13:36,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 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-01-11 11:13:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:13:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-11 11:13:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:13:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 11:13:36,919 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 11:13:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:36,919 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 11:13:36,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 11:13:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:36,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:36,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:36,921 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-11 11:13:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:36,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:36,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:37,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:37,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:37,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:37,135 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-11 11:13:37,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:37,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:37,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:37,140 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:13:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:37,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:37,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:37,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:37,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:37,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:37,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:37,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:37,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:37,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:37,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,225 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:37,281 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:37,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:37,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:37,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:13:37,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:37,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:37,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,508 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:37,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:13:37,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:37,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:37,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,606 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:37,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:13:37,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:37,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:37,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:37,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:13:37,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:37,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:13:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:13:37,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:37,764 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-11 11:13:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:38,526 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-11 11:13:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:38,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:13:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:38,528 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:13:38,528 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 11:13:38,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:13:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 11:13:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-11 11:13:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:13:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 11:13:38,555 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 11:13:38,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:38,555 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 11:13:38,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:13:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 11:13:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:38,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:38,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:38,556 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-11 11:13:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:38,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:38,652 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-11 11:13:38,652 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:38,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:38,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:38,659 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:38,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:38,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:38,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:38,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:38,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:13:38,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:13:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:13:38,723 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:38,783 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 11:13:38,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:13:38,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:38,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:13:38,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:13:38,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:38,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:13:38,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-01-11 11:13:38,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:38,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:38,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:38,918 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-11 11:13:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:39,149 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-11 11:13:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:39,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:13:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:39,151 INFO L225 Difference]: With dead ends: 93 [2019-01-11 11:13:39,151 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 11:13:39,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 11:13:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-11 11:13:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:13:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-11 11:13:39,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-11 11:13:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:39,173 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-11 11:13:39,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-11 11:13:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:39,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:39,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:39,174 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-11 11:13:39,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:39,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,419 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-11 11:13:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:39,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:39,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:39,524 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-11 11:13:39,525 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:39,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:39,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:39,528 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:13:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:39,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:39,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:39,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:39,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:39,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:39,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:39,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:39,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:39,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:39,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:39,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:39,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,028 INFO L303 Elim1Store]: Index analysis took 207 ms [2019-01-11 11:13:40,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:13:40,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:40,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:40,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:13:40,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:40,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:40,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,239 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:40,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 11:13:40,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:40,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:13:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:40,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:40,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:40,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:13:40,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:40,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:13:40,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:13:40,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:40,417 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-11 11:13:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:41,366 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-11 11:13:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:41,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:13:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:41,368 INFO L225 Difference]: With dead ends: 117 [2019-01-11 11:13:41,368 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 11:13:41,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:13:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 11:13:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-11 11:13:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:13:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-11 11:13:41,395 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-11 11:13:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:41,395 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-11 11:13:41,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:13:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-11 11:13:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:41,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:41,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:41,396 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-11 11:13:41,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:41,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:41,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:41,587 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 11:13:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:41,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:41,647 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:41,647 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-11 11:13:41,649 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:41,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:41,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:41,652 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:41,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:41,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:41,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:41,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:41,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:41,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:41,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:41,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:41,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:41,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:41,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:41,702 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:41,768 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:13:41,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:41,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:41,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:13:41,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:41,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:13:41,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,927 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:41,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:13:41,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:41,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:13:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:42,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:42,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:42,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:42,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:42,034 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-11 11:13:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:42,485 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-11 11:13:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:42,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:13:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:42,486 INFO L225 Difference]: With dead ends: 99 [2019-01-11 11:13:42,487 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 11:13:42,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 11:13:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-11 11:13:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:13:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-11 11:13:42,520 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-11 11:13:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:42,520 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-11 11:13:42,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-11 11:13:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:42,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:42,521 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:13:42,521 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:42,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-11 11:13:42,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:42,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:42,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:42,808 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-01-11 11:13:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:42,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:42,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:42,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:42,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:42,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:42,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:13:42,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:13:42,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:13:42,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:42,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:42,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:42,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:42,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:42,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:42,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:42,936 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:43,024 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:43,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:43,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:43,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:43,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:43,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:43,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:13:43,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:43,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:43,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-11 11:13:43,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:43,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:43,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:43,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:43,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:13:43,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:43,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:13:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:13:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:43,496 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-11 11:13:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:44,239 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-11 11:13:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:44,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 11:13:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:44,241 INFO L225 Difference]: With dead ends: 132 [2019-01-11 11:13:44,241 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 11:13:44,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:13:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 11:13:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-11 11:13:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:13:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-11 11:13:44,275 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-11 11:13:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:44,275 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-11 11:13:44,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:13:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-11 11:13:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:44,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:44,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:44,276 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-11 11:13:44,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:44,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:44,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:44,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:44,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:44,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:44,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:44,355 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-11 11:13:44,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:44,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:44,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:44,359 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:44,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:44,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:44,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:44,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:44,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:44,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:44,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:44,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:44,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:44,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:44,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:44,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:44,537 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:44,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:44,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:44,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:44,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:44,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:44,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:44,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:44,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:44,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:44,752 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-11 11:13:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:45,149 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-11 11:13:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:45,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:13:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:45,151 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:13:45,151 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 11:13:45,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 11:13:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-11 11:13:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:13:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-11 11:13:45,179 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-11 11:13:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:45,180 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-11 11:13:45,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-11 11:13:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:45,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:45,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:45,181 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-11 11:13:45,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:45,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:45,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:45,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:45,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:45,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:45,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:45,342 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-11 11:13:45,343 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:45,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:45,346 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:45,346 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:45,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:45,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:45,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:45,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:45,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:45,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:45,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:45,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:45,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,436 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:45,488 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:45,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:45,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:45,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:45,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:45,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:45,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:45,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:45,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:13:45,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:45,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:45,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:45,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:45,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:45,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:45,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:45,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:45,791 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-11 11:13:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:46,253 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-11 11:13:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:46,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:13:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:46,255 INFO L225 Difference]: With dead ends: 106 [2019-01-11 11:13:46,255 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:13:46,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:13:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-11 11:13:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:13:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-11 11:13:46,286 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-11 11:13:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:46,286 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-11 11:13:46,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-11 11:13:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:46,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:46,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:46,287 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:46,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-11 11:13:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:46,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:46,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:46,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:46,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:46,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:46,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:46,474 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-11 11:13:46,476 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:46,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:46,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:46,479 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:46,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:46,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:46,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:46,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:46,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:46,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:46,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:46,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:46,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:46,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:46,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:46,610 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:46,690 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:46,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:46,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:46,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:46,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,910 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:46,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:13:46,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:46,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:46,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:47,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:47,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:47,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:47,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:47,046 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-11 11:13:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:47,570 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-11 11:13:47,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:47,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:13:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:47,572 INFO L225 Difference]: With dead ends: 102 [2019-01-11 11:13:47,572 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 11:13:47,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 11:13:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-11 11:13:47,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 11:13:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-11 11:13:47,603 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-11 11:13:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:47,603 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-11 11:13:47,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-11 11:13:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:47,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:47,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:47,604 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-11 11:13:47,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:47,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:47,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:47,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:47,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:47,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:47,687 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-11 11:13:47,689 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:47,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:47,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:47,693 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:47,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:47,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:47,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:47,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:47,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:47,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:47,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:47,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:47,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:47,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:47,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:47,815 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:47,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:13:47,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:48,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:48,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,030 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:48,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:13:48,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:48,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:13:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:48,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:48,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:48,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:48,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:48,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:48,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:48,116 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-11 11:13:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:48,415 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-11 11:13:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:48,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:13:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:48,417 INFO L225 Difference]: With dead ends: 94 [2019-01-11 11:13:48,417 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 11:13:48,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 11:13:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-11 11:13:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 11:13:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-11 11:13:48,455 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-11 11:13:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:48,455 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-11 11:13:48,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-11 11:13:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:48,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:48,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:48,456 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-11 11:13:48,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:48,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:48,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:48,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:48,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:48,982 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 11:13:49,287 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-11 11:13:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:49,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:49,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:49,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:49,316 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-11 11:13:49,318 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:49,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:49,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:49,320 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:49,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:49,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:49,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:49,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:49,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:49,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:49,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:49,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:49,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:49,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:49,454 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,474 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:49,647 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:49,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:13:49,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:49,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:49,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,747 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:49,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:13:49,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:49,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:13:49,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 11:13:49,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:49,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:13:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:49,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:49,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:49,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:49,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:49,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:49,941 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-11 11:13:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:50,443 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-11 11:13:50,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:50,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:13:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:50,445 INFO L225 Difference]: With dead ends: 116 [2019-01-11 11:13:50,445 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 11:13:50,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 11:13:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-11 11:13:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 11:13:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-11 11:13:50,485 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-11 11:13:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:50,485 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-11 11:13:50,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-11 11:13:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:50,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:50,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:50,486 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-11 11:13:50,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:50,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:50,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:50,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:50,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:50,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:50,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:50,640 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-11 11:13:50,643 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:50,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:50,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:50,647 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:13:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:50,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:50,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:50,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:50,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:50,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:50,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:50,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:50,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:50,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:50,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:50,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:50,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,737 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:50,790 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:50,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:50,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:50,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:50,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:13:50,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:50,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:51,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,036 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:51,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:13:51,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:51,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:51,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,180 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:51,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:13:51,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:51,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:13:51,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:51,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:13:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:13:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:51,352 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-11 11:13:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:52,334 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-11 11:13:52,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:52,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:13:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:52,337 INFO L225 Difference]: With dead ends: 140 [2019-01-11 11:13:52,337 INFO L226 Difference]: Without dead ends: 139 [2019-01-11 11:13:52,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:13:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-11 11:13:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-11 11:13:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:13:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-11 11:13:52,376 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-11 11:13:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:52,377 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-11 11:13:52,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:13:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-11 11:13:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:52,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:52,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:52,377 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-11 11:13:52,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:52,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:52,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:52,492 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-11 11:13:52,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:52,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:52,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:52,495 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:52,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:52,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:52,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:52,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:52,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:52,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:52,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:52,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:13:52,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:13:52,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:13:52,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:52,606 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 11:13:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:13:52,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:52,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:13:52,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:13:52,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:52,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:13:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:52,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:52,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:52,741 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-11 11:13:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:53,033 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-11 11:13:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:53,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:13:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:53,035 INFO L225 Difference]: With dead ends: 112 [2019-01-11 11:13:53,035 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 11:13:53,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 11:13:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-11 11:13:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 11:13:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-11 11:13:53,072 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-11 11:13:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:53,072 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-11 11:13:53,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-11 11:13:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:53,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:53,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:53,073 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-11 11:13:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:53,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:53,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:53,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:53,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:53,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:53,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:53,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:53,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:53,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:53,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:53,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:13:53,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:53,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:53,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:53,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:53,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:53,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:53,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:53,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:53,370 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:53,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:53,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:53,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:53,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,494 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:53,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:53,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:53,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:53,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:13:53,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:53,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:53,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:13:53,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:53,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:13:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:53,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:53,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:13:53,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:53,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:13:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:13:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:13:53,904 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-11 11:13:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:54,797 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-11 11:13:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:54,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:13:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:54,799 INFO L225 Difference]: With dead ends: 137 [2019-01-11 11:13:54,799 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 11:13:54,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:13:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 11:13:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-11 11:13:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:13:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-11 11:13:54,839 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-11 11:13:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:54,839 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-11 11:13:54,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:13:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-11 11:13:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:54,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:54,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:54,840 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-11 11:13:54,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:54,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:54,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:54,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:54,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:54,952 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:54,952 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-11 11:13:54,953 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:54,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:54,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:54,957 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:54,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:54,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:54,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:54,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:54,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:54,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:54,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:54,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:54,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:54,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:54,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:55,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,031 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:55,085 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:55,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:55,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:55,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:55,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,238 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:55,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:55,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:55,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:55,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:55,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:55,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:55,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:55,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:55,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:55,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:55,575 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-11 11:13:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:56,070 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-11 11:13:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:56,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:13:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:56,072 INFO L225 Difference]: With dead ends: 124 [2019-01-11 11:13:56,072 INFO L226 Difference]: Without dead ends: 123 [2019-01-11 11:13:56,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-11 11:13:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-11 11:13:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:13:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-11 11:13:56,120 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-11 11:13:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:56,120 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-11 11:13:56,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-11 11:13:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:56,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:56,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:56,121 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-11 11:13:56,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:56,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:56,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:56,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:56,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:56,238 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-11 11:13:56,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:56,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:56,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:56,241 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:56,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:56,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:56,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:56,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:56,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:56,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:56,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:56,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:56,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,371 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:56,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:56,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,477 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:56,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:56,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:56,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:56,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:13:56,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:56,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:56,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:56,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:56,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:13:56,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:56,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:13:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:13:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:56,694 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-11 11:13:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:57,219 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-11 11:13:57,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:57,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:13:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:57,221 INFO L225 Difference]: With dead ends: 119 [2019-01-11 11:13:57,221 INFO L226 Difference]: Without dead ends: 118 [2019-01-11 11:13:57,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-11 11:13:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-11 11:13:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:13:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-11 11:13:57,272 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-11 11:13:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:57,272 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-11 11:13:57,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:13:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-11 11:13:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:57,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:57,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:57,274 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-11 11:13:57,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:57,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:57,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:57,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:57,406 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-11 11:13:57,407 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:57,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:57,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:57,408 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:13:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:57,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:57,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:57,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:57,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:57,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:57,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:57,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:57,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:57,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:57,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:57,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:13:57,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:13:57,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:13:57,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:13:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,729 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:57,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:13:57,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:57,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,829 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:57,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:13:57,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:13:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:57,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:13:57,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:57,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:13:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:13:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:57,956 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-11 11:13:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:58,971 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-11 11:13:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:58,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:13:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:58,973 INFO L225 Difference]: With dead ends: 149 [2019-01-11 11:13:58,973 INFO L226 Difference]: Without dead ends: 148 [2019-01-11 11:13:58,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:13:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-11 11:13:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-11 11:13:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 11:13:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-11 11:13:59,031 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-11 11:13:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:59,032 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-11 11:13:59,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:13:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-11 11:13:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:59,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:59,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:13:59,033 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-11 11:13:59,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:59,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:59,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:59,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:59,151 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-11 11:13:59,153 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:59,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:59,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:59,155 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:59,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:59,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:59,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:59,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:13:59,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:13:59,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:13:59,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:59,219 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:59,285 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:13:59,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:59,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:59,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:59,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:13:59,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:59,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:13:59,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,438 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:59,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:13:59,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:59,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:13:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:59,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:59,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:59,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:59,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:59,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:59,539 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-11 11:14:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:00,043 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-11 11:14:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:00,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:00,045 INFO L225 Difference]: With dead ends: 139 [2019-01-11 11:14:00,045 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 11:14:00,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 11:14:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-11 11:14:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:14:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-11 11:14:00,099 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-11 11:14:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:00,099 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-11 11:14:00,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-11 11:14:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:00,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:00,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:00,100 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-11 11:14:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:00,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:00,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:00,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:00,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:00,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:00,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:00,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:00,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:00,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:00,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:00,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:00,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:00,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:00,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:00,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:00,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:00,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:00,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:00,442 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:00,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:00,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:00,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:00,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:00,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:00,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:00,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:00,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:00,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:00,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:00,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:00,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:14:00,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:00,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:00,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:00,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:00,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:00,944 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-11 11:14:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:01,742 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-11 11:14:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:01,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:14:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:01,744 INFO L225 Difference]: With dead ends: 164 [2019-01-11 11:14:01,745 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 11:14:01,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 11:14:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-11 11:14:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 11:14:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-11 11:14:01,801 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-11 11:14:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:01,801 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-11 11:14:01,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-11 11:14:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:01,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:01,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:01,802 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-11 11:14:01,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:01,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:01,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:01,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:01,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:01,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:01,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:01,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:01,896 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-11 11:14:01,897 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:01,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:01,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:01,899 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:01,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:01,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:01,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:01,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:01,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:01,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:01,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:01,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:01,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:01,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:01,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:01,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:02,032 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:02,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:02,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:02,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:14:02,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:02,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:02,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:02,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:02,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:02,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:02,246 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-11 11:14:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:02,611 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-11 11:14:02,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:02,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:02,613 INFO L225 Difference]: With dead ends: 122 [2019-01-11 11:14:02,613 INFO L226 Difference]: Without dead ends: 121 [2019-01-11 11:14:02,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-11 11:14:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-11 11:14:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 11:14:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-11 11:14:02,674 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-11 11:14:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:02,674 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-11 11:14:02,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-11 11:14:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:02,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:02,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:02,674 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-11 11:14:02,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:02,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:02,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:02,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:02,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:02,818 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:02,818 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-11 11:14:02,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:02,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:02,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:02,820 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:02,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:02,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:02,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:02,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:02,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:02,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:02,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:02,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:02,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:02,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:02,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:02,959 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:02,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:02,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:03,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:03,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,067 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:03,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:03,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:03,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:03,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:14:03,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:03,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:03,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:03,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:03,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:03,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:03,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:03,267 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-11 11:14:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:03,827 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-11 11:14:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:03,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:03,829 INFO L225 Difference]: With dead ends: 154 [2019-01-11 11:14:03,829 INFO L226 Difference]: Without dead ends: 153 [2019-01-11 11:14:03,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-11 11:14:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-11 11:14:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:14:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-11 11:14:03,889 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-11 11:14:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:03,890 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-11 11:14:03,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-11 11:14:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:03,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:03,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:03,890 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-11 11:14:03,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:03,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:03,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:03,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:04,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:04,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:04,011 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-11 11:14:04,011 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:04,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:04,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:04,015 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:04,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:04,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:04,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:04,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:04,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:04,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:04,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:04,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:04,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:04,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:04,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:04,131 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:04,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:14:04,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:04,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:04,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:14:04,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:04,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:14:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:04,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:04,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:04,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:04,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:04,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:04,318 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-11 11:14:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:04,635 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-11 11:14:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:04,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:04,637 INFO L225 Difference]: With dead ends: 130 [2019-01-11 11:14:04,637 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 11:14:04,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 11:14:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-11 11:14:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:14:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-11 11:14:04,711 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-11 11:14:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:04,711 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-11 11:14:04,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-11 11:14:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:04,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:04,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:04,712 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-11 11:14:04,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:04,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:04,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:04,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:04,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:04,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:04,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:04,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:04,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:04,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:04,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:04,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:04,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:04,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:04,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:04,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:04,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:04,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:04,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,913 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,925 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:04,952 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:04,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:05,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:05,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:14:05,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:05,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:05,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,169 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:05,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:05,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:05,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:05,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:05,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:05,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:14:05,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:05,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:14:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:14:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:05,303 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-11 11:14:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:05,870 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-11 11:14:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:05,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:14:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:05,872 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:14:05,873 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:14:05,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:14:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-11 11:14:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 11:14:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-11 11:14:05,940 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-11 11:14:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:05,941 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-11 11:14:05,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:14:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-11 11:14:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:05,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:05,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:05,942 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-11 11:14:05,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:05,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:05,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:06,088 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 11:14:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:06,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:06,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:06,096 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:06,097 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-11 11:14:06,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:06,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:06,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:06,101 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:14:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:06,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:06,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:06,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:06,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:06,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:06,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:06,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:06,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:06,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:06,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:06,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:06,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,189 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:06,236 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:06,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:14:06,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:06,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:06,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:06,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:14:06,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:14:06,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:14:06,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:14:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:14:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:14:06,339 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-11 11:14:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:06,433 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-11 11:14:06,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:14:06,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 11:14:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:06,435 INFO L225 Difference]: With dead ends: 121 [2019-01-11 11:14:06,435 INFO L226 Difference]: Without dead ends: 117 [2019-01-11 11:14:06,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:14:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-11 11:14:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-11 11:14:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-11 11:14:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-11 11:14:06,504 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-11 11:14:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:06,504 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-11 11:14:06,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:14:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-11 11:14:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:06,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:06,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:06,505 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-11 11:14:06,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:06,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:06,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:06,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:06,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:06,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:06,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:06,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:06,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:06,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:06,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:06,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:06,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:06,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:06,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:06,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:06,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:06,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:06,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:06,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,742 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:06,796 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:06,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:06,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:06,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:06,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:14:06,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:06,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:06,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:07,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:14:07,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:07,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:07,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:07,231 INFO L303 Elim1Store]: Index analysis took 158 ms [2019-01-11 11:14:07,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:14:07,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:07,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:07,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:07,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:07,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:07,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:07,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:07,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:07,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:07,431 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-11 11:14:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:08,359 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-11 11:14:08,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:08,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:14:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:08,362 INFO L225 Difference]: With dead ends: 186 [2019-01-11 11:14:08,362 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 11:14:08,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 11:14:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-11 11:14:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:14:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-11 11:14:08,453 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-11 11:14:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:08,453 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-11 11:14:08,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-11 11:14:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:08,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:08,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:08,454 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:08,454 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-11 11:14:08,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:08,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:08,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:08,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:08,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:08,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:08,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:08,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:08,578 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-11 11:14:08,578 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:08,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:08,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:08,580 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:08,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:08,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:08,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:08,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:08,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:08,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:08,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:08,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:08,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:08,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:08,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:08,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:08,699 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:08,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:14:08,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:08,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:08,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:14:08,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:08,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:14:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:08,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:08,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:14:08,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:08,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:08,867 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-11 11:14:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:09,213 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-11 11:14:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:09,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:09,216 INFO L225 Difference]: With dead ends: 161 [2019-01-11 11:14:09,216 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 11:14:09,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 11:14:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-11 11:14:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 11:14:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-11 11:14:09,296 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-11 11:14:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:09,296 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-11 11:14:09,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-11 11:14:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:09,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:09,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:09,297 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-11 11:14:09,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:09,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:09,601 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-11 11:14:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:09,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:09,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:09,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:09,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:09,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:09,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:09,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:09,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:14:09,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:09,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:09,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:09,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:09,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:14:09,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:14:09,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:14:09,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:09,798 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 11:14:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:14:09,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:09,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:09,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:09,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:09,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:09,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:09,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:09,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:09,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:09,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:09,938 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-11 11:14:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:10,272 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-11 11:14:10,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:10,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:10,275 INFO L225 Difference]: With dead ends: 172 [2019-01-11 11:14:10,275 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 11:14:10,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 11:14:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-11 11:14:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 11:14:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-11 11:14:10,389 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-11 11:14:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:10,389 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-11 11:14:10,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-11 11:14:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:10,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:10,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:10,390 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:10,391 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-11 11:14:10,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:10,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:10,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:10,546 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 11:14:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:10,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:10,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:10,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:10,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:10,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:10,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:10,689 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:14:10,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:14:10,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:14:10,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:10,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:10,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:10,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:10,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:10,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:10,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,769 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:10,826 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:10,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:10,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:10,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:10,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,944 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:10,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:10,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:10,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:11,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:14:11,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:11,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:11,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,115 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:14:11,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:11,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:11,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:11,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:11,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:11,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:11,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:11,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:11,281 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-11 11:14:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:12,076 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-11 11:14:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:12,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 11:14:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:12,079 INFO L225 Difference]: With dead ends: 209 [2019-01-11 11:14:12,079 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:14:12,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:14:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-11 11:14:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 11:14:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-11 11:14:12,169 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-11 11:14:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:12,169 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-11 11:14:12,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-11 11:14:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:12,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:12,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:12,170 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-11 11:14:12,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:12,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:12,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:12,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:12,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:12,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:12,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:12,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:12,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:12,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:12,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:12,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:12,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:12,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:12,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:12,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:12,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:12,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:12,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:12,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:12,408 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:12,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:14:12,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:12,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:12,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:14:12,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:12,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:12,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,597 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:12,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-11 11:14:12,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:12,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:14:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:12,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:12,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:12,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:12,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:12,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:12,733 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-11 11:14:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:13,250 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-11 11:14:13,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:13,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:13,253 INFO L225 Difference]: With dead ends: 180 [2019-01-11 11:14:13,253 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 11:14:13,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 11:14:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-11 11:14:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 11:14:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-11 11:14:13,347 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-11 11:14:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:13,348 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-11 11:14:13,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-11 11:14:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:13,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:13,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:13,348 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-11 11:14:13,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:13,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:13,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:13,758 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 11:14:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:13,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:13,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:13,836 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:13,836 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-11 11:14:13,837 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:13,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:13,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:13,839 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:13,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:13,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:13,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:13,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:13,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:13,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:13,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:13,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:13,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:13,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:13,883 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:13,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:13,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:13,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:13,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:13,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:13,970 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:13,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:13,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:14,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:14,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:14,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:14:14,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:14,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:14,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,172 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:14,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:14:14,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:14,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:14,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,261 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:14,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:14:14,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:14,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:14,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:14,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:14,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:14:14,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:14,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:14,552 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-11 11:14:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:15,386 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-11 11:14:15,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:15,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:15,389 INFO L225 Difference]: With dead ends: 189 [2019-01-11 11:14:15,389 INFO L226 Difference]: Without dead ends: 188 [2019-01-11 11:14:15,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-11 11:14:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-11 11:14:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 11:14:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-11 11:14:15,491 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-11 11:14:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:15,491 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-11 11:14:15,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-11 11:14:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:15,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:15,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:15,492 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:15,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-11 11:14:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:15,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:15,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:15,664 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-11 11:14:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:15,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:15,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:15,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:15,796 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-11 11:14:15,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:15,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:15,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:15,800 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:15,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:15,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:15,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:15,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:15,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:15,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:15,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:15,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:15,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:15,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:15,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:15,868 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,965 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:15,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:16,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:16,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:16,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:14:16,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:16,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:16,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,175 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:16,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:14:16,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:16,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:16,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,264 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:16,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:16,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:16,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:16,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:16,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:16,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:14:16,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:16,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:14:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:14:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:16,416 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-11 11:14:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:17,228 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-11 11:14:17,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:17,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:14:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:17,231 INFO L225 Difference]: With dead ends: 169 [2019-01-11 11:14:17,231 INFO L226 Difference]: Without dead ends: 168 [2019-01-11 11:14:17,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-11 11:14:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-11 11:14:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:14:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-11 11:14:17,328 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-11 11:14:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:17,328 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-11 11:14:17,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:14:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-11 11:14:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:17,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:17,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:17,329 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-11 11:14:17,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:17,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:17,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:17,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:17,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:17,501 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:17,501 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-11 11:14:17,502 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:17,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:17,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:17,506 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:17,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:17,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:17,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:17,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:17,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:17,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:17,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:17,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:17,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:17,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:14:17,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 11:14:17,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-11 11:14:17,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:17,637 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-11 11:14:17,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 11:14:17,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 11:14:17,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:17,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:17,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-11 11:14:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:17,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:17,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:17,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:17,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:17,745 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-11 11:14:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:18,032 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-11 11:14:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:18,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:14:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:18,034 INFO L225 Difference]: With dead ends: 159 [2019-01-11 11:14:18,034 INFO L226 Difference]: Without dead ends: 158 [2019-01-11 11:14:18,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-11 11:14:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-11 11:14:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 11:14:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-11 11:14:18,129 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-11 11:14:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-11 11:14:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-11 11:14:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:18,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:18,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:18,130 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-11 11:14:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:18,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:18,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:18,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:18,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:18,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:18,349 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:18,350 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-11 11:14:18,350 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:18,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:18,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:18,353 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:14:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:18,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:18,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:18,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:18,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:18,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:18,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:18,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:18,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:18,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:18,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:18,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:18,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,520 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:18,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:18,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:18,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:18,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:14:18,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:18,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:18,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:18,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:14:18,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:18,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:18,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,800 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:18,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 11:14:18,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:18,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:18,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:18,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:14:18,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:18,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:18,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:19,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:19,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:14:19,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:19,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:14:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:14:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:14:19,084 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-11 11:14:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:20,351 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-11 11:14:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:20,352 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:14:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:20,354 INFO L225 Difference]: With dead ends: 199 [2019-01-11 11:14:20,355 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 11:14:20,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:14:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 11:14:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-11 11:14:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 11:14:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-11 11:14:20,450 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-11 11:14:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:20,450 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-11 11:14:20,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:14:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-11 11:14:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:20,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:20,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:20,451 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-11 11:14:20,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:20,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:20,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:20,614 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-11 11:14:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:20,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:20,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:20,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:20,687 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-11 11:14:20,688 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:20,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:20,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:20,691 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:20,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:20,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:20,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:20,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:20,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:20,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:20,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:20,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:20,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:20,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:20,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:20,853 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:14:20,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:20,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:14:21,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:21,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:14:21,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:21,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 11:14:21,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:21,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:14:21,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,158 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:21,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:14:21,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:21,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:14:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:21,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:21,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:21,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:21,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:21,282 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-11 11:14:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:21,993 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-11 11:14:21,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:21,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:21,996 INFO L225 Difference]: With dead ends: 181 [2019-01-11 11:14:21,996 INFO L226 Difference]: Without dead ends: 180 [2019-01-11 11:14:21,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-11 11:14:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-11 11:14:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 11:14:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-11 11:14:22,096 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-11 11:14:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:22,097 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-11 11:14:22,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-11 11:14:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:22,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:22,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:22,097 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-11 11:14:22,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:22,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:22,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:22,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:22,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:22,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:22,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:22,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:22,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:22,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:22,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:14:22,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:22,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:22,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:22,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:22,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:22,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:22,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:22,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,452 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:22,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:22,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:22,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:22,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:14:22,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:22,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:22,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:22,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:22,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:22,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:22,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,773 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:22,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:14:22,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:22,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:22,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:22,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:14:22,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:22,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:22,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:23,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:23,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:14:23,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:23,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:14:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:14:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:23,039 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-11 11:14:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:24,341 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-11 11:14:24,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:24,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:14:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:24,344 INFO L225 Difference]: With dead ends: 200 [2019-01-11 11:14:24,344 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 11:14:24,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:14:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 11:14:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-11 11:14:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 11:14:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-11 11:14:24,448 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-11 11:14:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:24,448 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-11 11:14:24,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:14:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-11 11:14:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:24,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:24,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:24,449 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-11 11:14:24,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:24,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:24,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:24,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:24,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:24,593 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 11:14:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:24,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:24,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:24,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:24,668 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-11 11:14:24,669 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:24,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:24,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:24,672 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:24,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:24,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:24,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:24,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:24,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:24,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:24,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:24,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:24,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:24,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:24,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:24,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,749 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:24,804 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:24,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:24,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:24,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:24,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:24,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:14:24,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:24,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:24,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:25,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,013 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:25,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:14:25,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:25,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:25,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:25,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:25,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:25,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:25,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:25,147 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-11 11:14:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:25,709 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-11 11:14:25,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:25,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:25,711 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:14:25,711 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:14:25,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:14:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-11 11:14:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 11:14:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-11 11:14:25,821 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-11 11:14:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:25,821 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-11 11:14:25,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-11 11:14:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:25,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:25,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:25,822 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-11 11:14:25,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:25,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:25,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:26,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:26,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:26,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:26,032 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-11 11:14:26,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:26,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:26,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:26,036 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:26,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:26,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:26,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:26,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:26,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:26,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:26,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:26,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:26,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:26,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:26,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:26,091 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:26,191 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:26,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:26,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:26,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:26,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:14:26,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:26,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:26,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,409 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:26,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:14:26,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:26,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:26,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,504 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:26,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:14:26,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:26,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:26,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:26,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:14:26,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:26,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:14:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:14:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:26,664 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-11 11:14:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:27,494 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-11 11:14:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:27,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:14:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:27,497 INFO L225 Difference]: With dead ends: 197 [2019-01-11 11:14:27,497 INFO L226 Difference]: Without dead ends: 196 [2019-01-11 11:14:27,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:14:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-11 11:14:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-11 11:14:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-11 11:14:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-11 11:14:27,612 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-11 11:14:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:27,612 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-11 11:14:27,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:14:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-11 11:14:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:27,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:27,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:27,613 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-11 11:14:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:27,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:27,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:27,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:27,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:27,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:27,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:27,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:27,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:27,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:27,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:27,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:27,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:27,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:27,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:27,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:27,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:27,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:27,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:27,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:28,006 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:28,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:28,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:28,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:28,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:28,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:14:28,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:28,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:28,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-11 11:14:28,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:28,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:28,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:28,296 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:28,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:14:28,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:28,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:28,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:28,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:28,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:28,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:28,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:28,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:28,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:28,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:28,447 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-11 11:14:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:29,328 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-11 11:14:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:29,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:29,330 INFO L225 Difference]: With dead ends: 195 [2019-01-11 11:14:29,330 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 11:14:29,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 11:14:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-11 11:14:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-11 11:14:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-11 11:14:29,478 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-11 11:14:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:29,479 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-11 11:14:29,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-11 11:14:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:29,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:29,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:29,480 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-11 11:14:29,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:29,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:29,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:29,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:29,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:29,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:29,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:29,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:29,626 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-11 11:14:29,628 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:29,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:29,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:29,631 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:29,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:29,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:29,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:29,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:29,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:29,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:29,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:29,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:29,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:29,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:29,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:29,692 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:29,761 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:14:29,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:29,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:29,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:29,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:14:29,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:29,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:14:29,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:29,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:14:29,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:29,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:29,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:14:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:29,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:30,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:30,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:30,036 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-11 11:14:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:30,564 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-11 11:14:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:30,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:30,566 INFO L225 Difference]: With dead ends: 157 [2019-01-11 11:14:30,567 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 11:14:30,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 11:14:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-11 11:14:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 11:14:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-11 11:14:30,683 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-11 11:14:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:30,684 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-11 11:14:30,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-11 11:14:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:30,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:30,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:30,684 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-11 11:14:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:30,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:30,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:30,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:30,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:30,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:30,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:30,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:30,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:30,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:30,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:30,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:30,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:30,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:30,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:30,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:30,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:30,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:30,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:30,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:31,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:31,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:14:31,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:31,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:31,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:31,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:14:31,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:31,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-11 11:14:31,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:14:31,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:31,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 11:14:31,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,267 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:31,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:14:31,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:31,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:14:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:31,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:31,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:31,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:31,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:31,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:31,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:31,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:31,393 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-11 11:14:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:32,069 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-11 11:14:32,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:32,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:32,072 INFO L225 Difference]: With dead ends: 178 [2019-01-11 11:14:32,072 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 11:14:32,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 11:14:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-11 11:14:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 11:14:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-11 11:14:32,180 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-11 11:14:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:32,180 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-11 11:14:32,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-11 11:14:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:32,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:32,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:32,181 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-11 11:14:32,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:32,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:32,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:32,559 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-11 11:14:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:32,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:32,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:32,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:32,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:32,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:32,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:32,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:32,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:32,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:32,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:32,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:32,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:32,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:32,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:32,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:32,700 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:32,785 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:32,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:32,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:32,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:32,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:14:32,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:32,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:32,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:32,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 11:14:32,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:33,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:33,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:33,086 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:33,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-11 11:14:33,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:33,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:33,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:33,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:33,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:33,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:14:33,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:33,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:33,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:33,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:33,236 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-11 11:14:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:34,202 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-11 11:14:34,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:14:34,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:34,205 INFO L225 Difference]: With dead ends: 204 [2019-01-11 11:14:34,205 INFO L226 Difference]: Without dead ends: 203 [2019-01-11 11:14:34,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:14:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-11 11:14:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-11 11:14:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-11 11:14:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-11 11:14:34,309 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-11 11:14:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:34,310 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-11 11:14:34,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-11 11:14:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:34,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:34,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:34,311 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-11 11:14:34,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:34,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:34,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:34,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:34,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:34,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:34,450 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-11 11:14:34,450 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:34,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:34,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:34,454 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:34,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:34,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:34,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:34,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:34,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:34,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:34,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:34,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:34,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:34,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:34,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:34,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:34,655 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:34,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:14:34,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:34,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:34,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,749 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:34,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:14:34,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:34,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:14:34,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:34,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 11:14:34,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:34,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:34,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:14:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:34,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:34,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:34,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:34,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:34,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:34,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:34,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:34,962 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-11 11:14:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:35,532 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-11 11:14:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:35,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:35,535 INFO L225 Difference]: With dead ends: 178 [2019-01-11 11:14:35,535 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 11:14:35,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 11:14:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-11 11:14:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 11:14:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-11 11:14:35,637 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-11 11:14:35,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:35,637 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-11 11:14:35,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-11 11:14:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:35,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:35,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:35,638 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-11 11:14:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:35,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:35,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:35,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:35,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:35,715 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-11 11:14:35,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:35,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:35,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:35,719 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:35,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:35,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:35,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:35,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:35,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:35,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:35,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:35,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:14:35,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:14:35,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:14:35,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:35,851 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-11 11:14:35,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:14:35,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:35,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:35,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:14:35,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:35,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:14:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:35,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:35,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:35,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:35,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:35,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:35,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:35,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:35,991 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-11 11:14:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:36,380 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-11 11:14:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:36,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:14:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:36,381 INFO L225 Difference]: With dead ends: 134 [2019-01-11 11:14:36,381 INFO L226 Difference]: Without dead ends: 133 [2019-01-11 11:14:36,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-11 11:14:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-11 11:14:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 11:14:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-11 11:14:36,486 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-11 11:14:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-11 11:14:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-11 11:14:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:36,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:36,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:36,487 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-11 11:14:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:36,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:36,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:36,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:36,622 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:36,623 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-11 11:14:36,623 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:36,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:36,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:36,625 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:36,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:36,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:36,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:36,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:36,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:36,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:36,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:36,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:36,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:36,673 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:36,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:36,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:36,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:36,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:14:36,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:36,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:36,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:36,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:14:36,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:37,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:37,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:37,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:37,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:37,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:37,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:37,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:37,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:37,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:37,087 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-11 11:14:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:37,687 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-11 11:14:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:37,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:37,690 INFO L225 Difference]: With dead ends: 143 [2019-01-11 11:14:37,690 INFO L226 Difference]: Without dead ends: 142 [2019-01-11 11:14:37,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-11 11:14:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-11 11:14:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 11:14:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-11 11:14:37,800 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-11 11:14:37,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:37,800 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-11 11:14:37,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-11 11:14:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:37,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:37,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:37,801 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-11 11:14:37,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:37,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:37,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:38,294 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-11 11:14:38,528 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-11 11:14:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:38,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:38,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:38,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:38,538 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-11 11:14:38,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:38,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:38,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:38,543 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:38,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:38,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:38,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:38,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:38,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:38,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:38,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:38,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:38,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:14:38,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,859 INFO L303 Elim1Store]: Index analysis took 140 ms [2019-01-11 11:14:38,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:14:38,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:14:38,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:38,933 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 11:14:38,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:14:38,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:38,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:38,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:38,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:38,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:39,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:39,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:39,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:39,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:39,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-11 11:14:39,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:39,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:39,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:14:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:39,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:39,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:39,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:39,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:39,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:39,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:39,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:39,123 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-11 11:14:39,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:39,632 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-11 11:14:39,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:39,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:39,634 INFO L225 Difference]: With dead ends: 151 [2019-01-11 11:14:39,634 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 11:14:39,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:14:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 11:14:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-11 11:14:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:14:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-11 11:14:39,743 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-11 11:14:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:39,743 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-11 11:14:39,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-11 11:14:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:39,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:39,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:39,744 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:39,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-11 11:14:39,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:39,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:39,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:39,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:39,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:39,901 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:39,901 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-11 11:14:39,902 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:39,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:39,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:39,905 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:39,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:39,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:39,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:39,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:39,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:39,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:39,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:39,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:39,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:39,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:39,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:39,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,098 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:40,152 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:40,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:40,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:40,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:40,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,269 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:40,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:40,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:40,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:40,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,357 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:40,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:40,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:40,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:40,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:14:40,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:40,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:40,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:40,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:40,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:14:40,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:40,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:40,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:40,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:40,582 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-11 11:14:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:41,466 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-11 11:14:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:41,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:41,469 INFO L225 Difference]: With dead ends: 215 [2019-01-11 11:14:41,469 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 11:14:41,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 11:14:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-11 11:14:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-11 11:14:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-11 11:14:41,605 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-11 11:14:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:41,606 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-11 11:14:41,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-11 11:14:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:41,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:41,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:41,607 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-11 11:14:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:41,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:41,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:41,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:41,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:41,630 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-11 11:14:41,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:41,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:41,634 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:41,634 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:14:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:41,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:41,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:41,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:41,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:41,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:41,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:41,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:41,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:41,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:14:41,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 11:14:41,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 11:14:41,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,726 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:41,764 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 11:14:41,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 11:14:41,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:14:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:41,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:41,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:14:41,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:14:41,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:14:41,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:14:41,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:14:41,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:14:41,886 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-11 11:14:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:42,239 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-11 11:14:42,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:14:42,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 11:14:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:42,244 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:14:42,244 INFO L226 Difference]: Without dead ends: 275 [2019-01-11 11:14:42,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:14:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-11 11:14:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-11 11:14:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-11 11:14:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-11 11:14:42,517 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-11 11:14:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:42,517 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-11 11:14:42,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:14:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-11 11:14:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:42,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:42,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:42,518 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:42,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-11 11:14:42,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:42,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:42,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:42,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:42,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:42,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:42,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:42,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:42,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:42,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:42,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:42,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:42,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:42,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:42,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:42,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:42,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:42,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:42,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:42,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:42,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:42,800 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:42,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:42,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:42,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:42,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:14:42,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:42,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:42,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:42,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:42,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,004 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:43,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:43,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:43,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:43,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:43,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:43,098 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:43,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:43,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:43,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:43,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:43,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:43,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:43,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:14:43,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:43,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:14:43,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:14:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:43,242 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-11 11:14:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:44,257 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-11 11:14:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:44,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:14:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:44,261 INFO L225 Difference]: With dead ends: 329 [2019-01-11 11:14:44,261 INFO L226 Difference]: Without dead ends: 328 [2019-01-11 11:14:44,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:14:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-11 11:14:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-11 11:14:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-11 11:14:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-11 11:14:44,539 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-11 11:14:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:44,539 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-11 11:14:44,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:14:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-11 11:14:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:44,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:44,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:44,540 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-11 11:14:44,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:44,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:44,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:44,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:44,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:44,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:44,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:44,672 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-11 11:14:44,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:44,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:44,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:44,675 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:44,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:44,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:44,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:44,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:44,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:44,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:44,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:44,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:44,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:44,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:14:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:44,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,755 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:44,805 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:14:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:14:44,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:44,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:44,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:44,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:14:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:44,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:44,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:14:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:44,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:45,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:45,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:45,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:45,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:45,003 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-11 11:14:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:45,590 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-11 11:14:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:45,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:14:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:45,594 INFO L225 Difference]: With dead ends: 290 [2019-01-11 11:14:45,594 INFO L226 Difference]: Without dead ends: 286 [2019-01-11 11:14:45,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-11 11:14:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-11 11:14:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-11 11:14:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-11 11:14:45,876 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-11 11:14:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:45,876 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-11 11:14:45,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-11 11:14:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:45,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:45,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:45,878 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:45,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-11 11:14:45,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:45,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:45,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:45,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:45,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:45,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:45,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:45,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:45,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:46,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:46,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:46,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:46,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:46,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:46,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:46,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:46,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:14:46,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:14:46,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:14:46,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:46,120 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 11:14:46,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:14:46,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:46,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:46,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,194 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:46,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-11 11:14:46,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:46,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:46,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:46,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:46,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:46,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:46,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:46,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:46,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:46,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:46,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:46,325 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-11 11:14:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:47,010 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-11 11:14:47,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:47,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:47,014 INFO L225 Difference]: With dead ends: 307 [2019-01-11 11:14:47,014 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 11:14:47,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 11:14:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-11 11:14:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-11 11:14:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-11 11:14:47,284 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-11 11:14:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:47,284 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-11 11:14:47,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-11 11:14:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:47,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:47,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:47,285 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-11 11:14:47,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:47,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:47,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:47,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:47,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:47,427 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-11 11:14:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:47,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:47,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:47,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:47,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:47,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:47,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:47,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:14:47,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:14:47,584 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:14:47,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:47,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:47,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:47,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:47,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:47,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:47,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:47,610 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:47,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:47,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:47,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:47,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,826 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:47,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:47,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:47,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:47,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,918 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:47,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:47,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:47,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:47,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:47,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:47,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:14:48,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:48,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:48,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:48,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,093 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:48,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:48,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:14:48,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:48,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:48,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:14:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:48,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:48,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:48,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:14:48,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:48,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:14:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:14:48,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:14:48,286 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-11 11:14:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:49,622 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-11 11:14:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:49,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 11:14:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:49,626 INFO L225 Difference]: With dead ends: 284 [2019-01-11 11:14:49,626 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:14:49,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:14:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:14:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-11 11:14:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-11 11:14:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-11 11:14:49,892 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-11 11:14:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:49,893 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-11 11:14:49,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:14:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-11 11:14:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:49,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:49,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:49,893 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-11 11:14:49,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:49,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:49,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:49,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:49,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:49,952 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:49,952 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-11 11:14:49,953 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:49,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:49,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:49,956 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:49,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:49,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:49,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:49,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:49,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:49,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:49,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:49,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:49,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:50,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:50,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,042 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,068 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:50,096 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:50,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:50,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:50,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:50,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:50,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:14:50,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:50,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:50,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:50,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:14:50,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:50,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:50,301 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-11 11:14:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:50,847 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-11 11:14:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:50,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:14:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:50,851 INFO L225 Difference]: With dead ends: 230 [2019-01-11 11:14:50,851 INFO L226 Difference]: Without dead ends: 223 [2019-01-11 11:14:50,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-11 11:14:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-11 11:14:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-11 11:14:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-11 11:14:51,139 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-11 11:14:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:51,139 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-11 11:14:51,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-11 11:14:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:51,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:51,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:51,140 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-11 11:14:51,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:51,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:51,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:51,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:51,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:51,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:51,285 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-11 11:14:51,286 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:51,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:51,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:51,288 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:51,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:51,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:51,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:51,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:51,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:51,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:51,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:51,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:51,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:51,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:51,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:51,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:51,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:51,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:14:51,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:51,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:51,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:51,687 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:51,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:14:51,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:51,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:51,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:51,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:51,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:51,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 11:14:51,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:51,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:14:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:14:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:51,831 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-11 11:14:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:52,561 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-11 11:14:52,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:52,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:14:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:52,565 INFO L225 Difference]: With dead ends: 254 [2019-01-11 11:14:52,565 INFO L226 Difference]: Without dead ends: 253 [2019-01-11 11:14:52,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-11 11:14:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-11 11:14:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-11 11:14:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-11 11:14:52,859 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-11 11:14:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:52,859 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-11 11:14:52,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:14:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-11 11:14:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:52,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:52,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:52,860 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:52,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-11 11:14:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:52,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:52,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:52,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:52,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:53,146 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 11:14:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:53,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:53,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:53,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:53,158 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-11 11:14:53,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:53,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:53,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:53,161 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:53,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:53,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:53,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:53,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:53,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:53,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:53,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:53,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:53,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:53,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,302 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:53,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:53,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:53,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,404 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:53,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:53,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:53,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:53,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:53,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:14:53,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:53,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:14:53,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:14:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:53,509 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-11 11:14:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:53,980 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-11 11:14:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:53,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:14:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:53,983 INFO L225 Difference]: With dead ends: 223 [2019-01-11 11:14:53,983 INFO L226 Difference]: Without dead ends: 216 [2019-01-11 11:14:53,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-11 11:14:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-11 11:14:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-11 11:14:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-11 11:14:54,293 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-11 11:14:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:54,293 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-11 11:14:54,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:14:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-11 11:14:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:54,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:54,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:54,294 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:54,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-11 11:14:54,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:54,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:54,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:54,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:54,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:54,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:54,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:54,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:54,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:54,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:54,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:54,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:14:54,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:14:54,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:14:54,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:54,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:54,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:54,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:54,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:54,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:54,537 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,593 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,623 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:54,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:54,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:54,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:14:54,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:54,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,830 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:54,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:54,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:54,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,925 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:54,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:14:54,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:54,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:55,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:55,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:55,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:55,091 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-11 11:14:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:56,216 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-11 11:14:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:56,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:56,220 INFO L225 Difference]: With dead ends: 285 [2019-01-11 11:14:56,220 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:14:56,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:14:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:14:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-11 11:14:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 11:14:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-11 11:14:56,495 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-11 11:14:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:56,495 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-11 11:14:56,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-11 11:14:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:56,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:56,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:56,496 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-11 11:14:56,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:56,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:56,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:56,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:56,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:56,876 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 11:14:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:56,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:56,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:56,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:56,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:56,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:56,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:56,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:56,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:56,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:56,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:56,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:56,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:56,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:56,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:56,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:56,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:57,053 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:57,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:57,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:57,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,168 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:57,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:14:57,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:57,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:57,519 INFO L303 Elim1Store]: Index analysis took 283 ms [2019-01-11 11:14:57,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:14:57,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:57,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:57,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:57,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:57,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:57,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:57,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:57,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:57,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:57,646 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-11 11:14:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:58,445 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-11 11:14:58,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:58,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:58,449 INFO L225 Difference]: With dead ends: 252 [2019-01-11 11:14:58,449 INFO L226 Difference]: Without dead ends: 247 [2019-01-11 11:14:58,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-11 11:14:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-11 11:14:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 11:14:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-11 11:14:58,718 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-11 11:14:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:58,718 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-11 11:14:58,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-11 11:14:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:58,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:58,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:58,719 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-11 11:14:58,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:58,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:58,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:58,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:58,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:58,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:58,812 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-11 11:14:58,812 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:58,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:58,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:58,814 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:58,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:58,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:58,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:58,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:58,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:58,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:58,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:58,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:58,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:58,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:58,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:58,862 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:58,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:58,949 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:14:58,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:58,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:14:58,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:59,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:59,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:14:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:59,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:59,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:14:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:59,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:59,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:59,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:14:59,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:59,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:14:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:14:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:59,176 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-11 11:14:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:59,685 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-11 11:14:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:59,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:14:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:59,688 INFO L225 Difference]: With dead ends: 194 [2019-01-11 11:14:59,688 INFO L226 Difference]: Without dead ends: 193 [2019-01-11 11:14:59,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-11 11:14:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-11 11:14:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-11 11:14:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-11 11:14:59,958 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-11 11:14:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:59,958 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-11 11:14:59,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:14:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-11 11:14:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:59,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:59,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:59,959 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-11 11:14:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:59,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:59,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:00,118 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-11 11:15:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:00,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:00,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:00,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:00,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:00,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:00,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:00,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:00,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:00,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:00,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:00,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:00,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:15:00,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:15:00,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:00,233 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:00,302 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:15:00,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,486 INFO L303 Elim1Store]: Index analysis took 147 ms [2019-01-11 11:15:00,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:00,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:00,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:00,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:00,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:00,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:00,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,605 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:00,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 11:15:00,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:00,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:15:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:00,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:00,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:00,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:00,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:00,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:00,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:00,714 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-11 11:15:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:01,557 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-11 11:15:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:01,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:15:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:01,560 INFO L225 Difference]: With dead ends: 265 [2019-01-11 11:15:01,560 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 11:15:01,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 11:15:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-11 11:15:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 11:15:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-11 11:15:01,898 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-11 11:15:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:01,898 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-11 11:15:01,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-11 11:15:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:01,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:01,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:01,899 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-11 11:15:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:01,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:01,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:01,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:01,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:01,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:01,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:01,979 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:01,979 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-11 11:15:01,979 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:01,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:01,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:01,981 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:01,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:01,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:01,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:01,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:01,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:01,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:01,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:02,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:02,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:15:02,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:15:02,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:15:02,045 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:02,105 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 11:15:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:15:02,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:02,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:15:02,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,177 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:02,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-11 11:15:02,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:02,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:15:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:02,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:02,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:02,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:15:02,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:02,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:15:02,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:15:02,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:15:02,248 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-11 11:15:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:02,751 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-11 11:15:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:02,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:15:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:02,754 INFO L225 Difference]: With dead ends: 210 [2019-01-11 11:15:02,754 INFO L226 Difference]: Without dead ends: 203 [2019-01-11 11:15:02,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:15:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-11 11:15:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-11 11:15:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 11:15:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-11 11:15:03,101 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-11 11:15:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:03,101 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-11 11:15:03,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:15:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-11 11:15:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:03,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:03,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:03,102 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-11 11:15:03,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:03,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:03,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:03,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:03,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:03,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:03,180 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-11 11:15:03,181 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:03,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:03,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:03,182 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:03,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:03,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15: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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:03,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:03,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:03,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:03,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:03,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:03,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:15:03,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:15:03,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:03,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:03,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:15:03,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:03,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:03,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:15:03,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:03,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:03,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:03,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:03,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:15:03,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:03,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:15:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:15:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:15:03,487 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-11 11:15:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:04,077 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-11 11:15:04,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:04,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 11:15:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:04,079 INFO L225 Difference]: With dead ends: 216 [2019-01-11 11:15:04,079 INFO L226 Difference]: Without dead ends: 212 [2019-01-11 11:15:04,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:15:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-11 11:15:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-11 11:15:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-11 11:15:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-11 11:15:04,442 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-11 11:15:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:04,442 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-11 11:15:04,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:15:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-11 11:15:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:04,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:04,443 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:04,443 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-11 11:15:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:04,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:04,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:04,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:04,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:04,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:04,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:04,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:04,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:04,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:04,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:04,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:04,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:04,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:04,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:04,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:04,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:04,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:04,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:04,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:04,677 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:04,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:04,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:04,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-11 11:15:04,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:04,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:04,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:04,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:15:04,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:04,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:04,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:04,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:04,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:04,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:15:04,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:04,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:04,985 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-11 11:15:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:06,047 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-11 11:15:06,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:06,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:15:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:06,050 INFO L225 Difference]: With dead ends: 401 [2019-01-11 11:15:06,050 INFO L226 Difference]: Without dead ends: 397 [2019-01-11 11:15:06,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-11 11:15:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-11 11:15:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-11 11:15:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-11 11:15:06,675 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-11 11:15:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:06,676 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-11 11:15:06,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-11 11:15:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:06,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:06,677 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:06,677 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:06,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-11 11:15:06,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:06,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:06,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:06,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:15:06,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:15:06,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:15:06,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:15:06,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:15:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:15:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:15:06,732 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-11 11:15:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:07,380 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-11 11:15:07,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:15:07,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-11 11:15:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:07,382 INFO L225 Difference]: With dead ends: 347 [2019-01-11 11:15:07,382 INFO L226 Difference]: Without dead ends: 342 [2019-01-11 11:15:07,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:15:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-11 11:15:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-11 11:15:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-11 11:15:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-11 11:15:08,016 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-11 11:15:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:08,017 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-11 11:15:08,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:15:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-11 11:15:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:08,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:08,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:08,018 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-11 11:15:08,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:08,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:08,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:08,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:08,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:08,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:08,210 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-11 11:15:08,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:08,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:08,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:08,213 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:15:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:08,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:08,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:08,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:08,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:08,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:08,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:08,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:08,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:08,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:08,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:08,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:08,258 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,379 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,442 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:08,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:08,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:08,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:15:08,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:08,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,644 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:08,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:15:08,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:08,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:08,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,735 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:08,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:15:08,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:08,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:08,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,832 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:15:08,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:08,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:08,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:09,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:15:09,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:09,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:15:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:15:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:15:09,004 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-11 11:15:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:10,720 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-11 11:15:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:10,721 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-11 11:15:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:10,724 INFO L225 Difference]: With dead ends: 471 [2019-01-11 11:15:10,724 INFO L226 Difference]: Without dead ends: 470 [2019-01-11 11:15:10,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:15:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-11 11:15:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-11 11:15:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-11 11:15:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-11 11:15:11,396 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-11 11:15:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:11,397 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-11 11:15:11,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:15:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-11 11:15:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:11,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:11,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:11,398 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:11,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-11 11:15:11,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:11,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:11,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:11,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:11,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:11,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:11,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:11,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:11,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:11,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:11,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:11,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:11,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:15:11,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:11,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:11,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:11,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:11,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:11,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,723 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:11,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:11,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:11,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:11,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:15:11,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:11,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:11,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,931 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:11,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:11,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:15:11,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:11,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:11,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,041 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:12,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:15:12,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:12,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:12,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,153 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:12,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:15:12,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:12,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:12,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:12,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:12,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:15:12,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:12,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:15:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:15:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:15:12,332 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-11 11:15:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:14,117 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-11 11:15:14,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:14,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-11 11:15:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:14,121 INFO L225 Difference]: With dead ends: 483 [2019-01-11 11:15:14,121 INFO L226 Difference]: Without dead ends: 482 [2019-01-11 11:15:14,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:15:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-11 11:15:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-11 11:15:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-11 11:15:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-11 11:15:14,824 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-11 11:15:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:14,825 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-11 11:15:14,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:15:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-11 11:15:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:14,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:14,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:14,826 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-11 11:15:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:14,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:14,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:14,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:14,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:14,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:14,946 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:15:14,947 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:14,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:14,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:14,950 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:14,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:14,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:14,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:14,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:14,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:14,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:14,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:14,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:14,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:15:15,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:15:15,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:15:15,011 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:15,222 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 11:15:15,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:15:15,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-11 11:15:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:15:15,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:15,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-11 11:15:15,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:15,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-11 11:15:15,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:15,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:15:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:15,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:15,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:15,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:15,430 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-11 11:15:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:16,443 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-11 11:15:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:16,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:15:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:16,446 INFO L225 Difference]: With dead ends: 400 [2019-01-11 11:15:16,446 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 11:15:16,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 11:15:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-11 11:15:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-11 11:15:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-11 11:15:17,148 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-11 11:15:17,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:17,148 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-11 11:15:17,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-11 11:15:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:17,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:17,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:17,150 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:17,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-11 11:15:17,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:17,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:17,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:17,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:17,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:17,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:17,307 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-11 11:15:17,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:17,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:17,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:17,309 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:17,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:17,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:17,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:17,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:17,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:17,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:17,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:17,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:17,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:17,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:17,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,388 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:17,446 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:17,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:17,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:17,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:17,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:15:17,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:17,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:17,649 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:17,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:15:17,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:17,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:17,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:17,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:17,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:17,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:17,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:17,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:17,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:17,777 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-11 11:15:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:18,883 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-11 11:15:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:18,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:15:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:18,885 INFO L225 Difference]: With dead ends: 409 [2019-01-11 11:15:18,885 INFO L226 Difference]: Without dead ends: 397 [2019-01-11 11:15:18,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-11 11:15:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-11 11:15:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-11 11:15:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-11 11:15:19,601 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-11 11:15:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:19,601 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-11 11:15:19,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-11 11:15:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:19,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:19,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:19,603 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-11 11:15:19,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:19,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:19,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:19,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:19,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:19,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:19,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:19,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:19,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:19,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:15:19,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:15:19,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:15:19,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:19,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:19,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:19,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:19,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:19,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:19,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:19,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:19,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:19,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,017 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:20,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:20,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:20,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:20,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:15:20,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:20,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:20,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,257 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:20,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:15:20,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:20,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:20,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,355 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:20,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:15:20,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:20,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:20,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:20,450 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:20,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:15:20,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:20,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:20,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:20,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:20,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:20,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:15:20,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:20,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:15:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:15:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:15:20,631 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-11 11:15:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:22,624 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-11 11:15:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:22,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 11:15:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:22,628 INFO L225 Difference]: With dead ends: 542 [2019-01-11 11:15:22,628 INFO L226 Difference]: Without dead ends: 536 [2019-01-11 11:15:22,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:15:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-11 11:15:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-11 11:15:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-11 11:15:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-11 11:15:23,524 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-11 11:15:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:23,524 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-11 11:15:23,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:15:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-11 11:15:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:23,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:23,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:23,526 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-11 11:15:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:23,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:23,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:23,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:23,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:23,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:23,643 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-11 11:15:23,644 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:23,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:23,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:23,647 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:23,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:23,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:23,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:23,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:23,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:23,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:23,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:23,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:23,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:23,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:23,789 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:23,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:23,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:23,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:23,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:15:23,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:23,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:23,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:23,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:23,993 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:23,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 11:15:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:24,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:24,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:24,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:15:24,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:24,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:24,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:24,120 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-11 11:15:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:25,416 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-11 11:15:25,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:25,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:15:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:25,419 INFO L225 Difference]: With dead ends: 469 [2019-01-11 11:15:25,419 INFO L226 Difference]: Without dead ends: 465 [2019-01-11 11:15:25,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:15:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-11 11:15:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-11 11:15:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-11 11:15:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-11 11:15:26,368 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-11 11:15:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:26,368 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-11 11:15:26,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-11 11:15:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:26,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:26,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:26,370 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-11 11:15:26,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:26,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:26,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:26,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:26,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:26,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:26,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:26,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:26,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:26,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:26,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:26,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:26,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:26,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:26,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:26,668 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:26,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:15:26,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:26,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:26,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,869 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:26,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 11:15:26,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:26,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:26,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:26,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:26,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-11 11:15:26,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:27,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:27,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:27,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,045 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:27,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:15:27,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:27,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:27,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:27,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:27,145 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:27,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:15:27,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:27,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:27,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:15:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:27,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:27,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:27,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:15:27,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:27,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:15:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:15:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:15:27,350 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-11 11:15:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:29,137 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-11 11:15:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:29,137 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 11:15:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:29,140 INFO L225 Difference]: With dead ends: 481 [2019-01-11 11:15:29,140 INFO L226 Difference]: Without dead ends: 480 [2019-01-11 11:15:29,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:15:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-11 11:15:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-11 11:15:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-11 11:15:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-11 11:15:29,646 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-11 11:15:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-11 11:15:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:15:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-11 11:15:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:29,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:29,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:29,647 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:29,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-11 11:15:29,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:29,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:29,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:29,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:29,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:29,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:29,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:29,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:29,736 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 11:15:29,736 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:29,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:29,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:29,739 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:29,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:29,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:29,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:29,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:29,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:29,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:29,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:29,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:29,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:15:29,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-11 11:15:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-11 11:15:29,800 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:29,858 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-11 11:15:29,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:15:29,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:29,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-11 11:15:29,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:29,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 11:15:29,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:29,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:29,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-11 11:15:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:29,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:15:30,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:30,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:30,003 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-11 11:15:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:30,727 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-11 11:15:30,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:30,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-11 11:15:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:30,730 INFO L225 Difference]: With dead ends: 267 [2019-01-11 11:15:30,730 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 11:15:30,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 11:15:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-11 11:15:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-11 11:15:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-11 11:15:31,265 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-11 11:15:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:31,265 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-11 11:15:31,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-11 11:15:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:31,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:31,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:31,266 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-11 11:15:31,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:31,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:31,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:31,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:31,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:31,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:31,460 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-11 11:15:31,461 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:31,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:31,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:31,463 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:31,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:31,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:31,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:31,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:31,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:31,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:31,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:31,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:31,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:31,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:31,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:31,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,606 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:31,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:15:31,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:31,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:31,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:15:31,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:31,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:31,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:31,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:15:31,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:31,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:31,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:31,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:31,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:15:31,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:31,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:31,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:15:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:31,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:32,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:32,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:15:32,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:32,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:32,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:32,082 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-11 11:15:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:33,374 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-11 11:15:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:33,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:15:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:33,377 INFO L225 Difference]: With dead ends: 309 [2019-01-11 11:15:33,377 INFO L226 Difference]: Without dead ends: 306 [2019-01-11 11:15:33,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:15:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-11 11:15:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-11 11:15:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-11 11:15:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-11 11:15:34,015 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-11 11:15:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:34,015 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-11 11:15:34,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-11 11:15:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:34,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:34,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:34,016 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-11 11:15:34,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:34,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:34,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:34,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:34,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:34,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:34,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:34,119 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:34,119 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:15:34,120 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:34,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:34,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:34,122 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:34,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:34,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:34,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:34,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:34,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:34,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:34,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:34,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:34,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-11 11:15:34,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-11 11:15:34,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-11 11:15:34,182 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:34,233 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-11 11:15:34,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:15:34,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-11 11:15:34,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:34,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:34,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-11 11:15:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:34,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:34,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:34,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:15:34,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:34,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:34,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:34,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:34,346 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-11 11:15:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:35,510 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-11 11:15:35,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:15:35,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:15:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:35,512 INFO L225 Difference]: With dead ends: 379 [2019-01-11 11:15:35,512 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 11:15:35,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:15:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 11:15:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-11 11:15:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-11 11:15:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-11 11:15:36,247 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-11 11:15:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:36,248 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-11 11:15:36,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-11 11:15:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:36,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:36,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:36,248 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:36,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-11 11:15:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:36,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:36,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:36,498 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-01-11 11:15:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:36,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:36,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:36,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:36,581 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-11 11:15:36,583 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:36,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:36,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:36,584 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:36,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:36,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:36,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:36,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:36,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:36,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:36,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:36,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:15:36,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:15:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:36,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:36,762 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:15:36,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:36,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:36,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:36,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:36,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:36,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:36,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,923 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:36,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 11:15:36,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:36,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:36,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:15:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:36,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:36,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:15:36,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:37,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:37,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:15:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:37,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:37,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:15:37,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:37,115 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-11 11:15:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:38,848 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-11 11:15:38,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:38,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 11:15:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:38,853 INFO L225 Difference]: With dead ends: 371 [2019-01-11 11:15:38,853 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 11:15:38,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:15:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 11:15:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-11 11:15:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-11 11:15:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-11 11:15:39,816 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-11 11:15:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:39,816 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-11 11:15:39,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-11 11:15:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:39,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:39,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:39,817 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-11 11:15:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:39,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:39,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:39,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:39,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:39,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:39,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:39,939 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:39,939 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-11 11:15:39,940 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:39,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:39,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:39,942 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:39,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:39,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:39,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:39,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:39,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:39,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:39,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:39,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:39,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:39,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:39,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:39,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:39,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:40,070 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:40,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:15:40,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:40,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:40,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,188 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:40,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:15:40,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:40,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:40,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:15:40,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:40,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:40,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:40,363 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:40,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:15:40,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:40,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:40,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:15:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:40,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:40,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:40,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:15:40,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:40,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:40,509 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-11 11:15:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:42,050 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-11 11:15:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:42,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:15:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:42,052 INFO L225 Difference]: With dead ends: 285 [2019-01-11 11:15:42,052 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 11:15:42,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:15:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 11:15:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-11 11:15:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-11 11:15:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-11 11:15:42,948 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-11 11:15:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:42,948 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-11 11:15:42,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-11 11:15:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:42,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:42,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:42,949 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-11 11:15:42,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:42,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:42,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:43,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:43,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:43,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:43,072 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-11 11:15:43,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:43,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:43,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:43,074 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:43,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:43,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:43,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:43,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:43,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:43,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:43,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:43,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:43,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:43,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:43,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:43,203 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:43,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:15:43,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:43,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:43,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,315 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:43,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:15:43,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:43,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:43,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:15:43,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:43,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:43,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:43,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:43,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:15:43,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:43,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:43,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:43,530 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-11 11:15:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:44,899 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-11 11:15:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:44,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:15:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:44,900 INFO L225 Difference]: With dead ends: 281 [2019-01-11 11:15:44,900 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 11:15:44,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 11:15:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-11 11:15:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-11 11:15:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-11 11:15:45,916 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-11 11:15:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:45,916 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-11 11:15:45,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-11 11:15:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:45,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:45,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:45,917 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-11 11:15:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:45,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:45,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:45,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:45,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:46,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:46,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:46,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:46,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:46,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:46,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:46,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:46,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:46,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:46,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:46,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:46,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:46,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:46,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:46,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:46,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:46,215 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:15:46,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:15:46,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:46,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:46,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,326 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:46,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:15:46,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:46,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:46,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:46,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:15:46,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:46,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:46,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:46,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:15:46,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:46,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:46,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:46,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:46,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:46,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:15:46,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:46,661 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-11 11:15:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:48,382 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-11 11:15:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:48,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 11:15:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:48,383 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:15:48,383 INFO L226 Difference]: Without dead ends: 288 [2019-01-11 11:15:48,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:15:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-11 11:15:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-11 11:15:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-11 11:15:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-11 11:15:49,419 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-11 11:15:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:49,420 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-11 11:15:49,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-11 11:15:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:49,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:49,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:49,420 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-11 11:15:49,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:49,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:49,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:49,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:49,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:49,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:49,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:49,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:49,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:49,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:49,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:49,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:49,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:49,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:49,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:49,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:15:49,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:15:49,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:49,636 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:49,705 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:15:49,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:49,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:49,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:49,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:15:49,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:49,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:49,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,882 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:49,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:15:49,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:49,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:15:49,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:49,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:49,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 11:15:49,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:49,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:49,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:15:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:50,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:50,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:50,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:15:50,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:50,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:50,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:50,076 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-11 11:15:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:52,057 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-11 11:15:52,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:52,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 11:15:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:52,059 INFO L225 Difference]: With dead ends: 370 [2019-01-11 11:15:52,060 INFO L226 Difference]: Without dead ends: 363 [2019-01-11 11:15:52,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:15:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-11 11:15:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-11 11:15:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-11 11:15:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-11 11:15:53,227 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-11 11:15:53,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:53,227 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-11 11:15:53,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-11 11:15:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:53,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:53,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:53,228 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-11 11:15:53,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:53,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:53,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:53,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:53,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:53,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:53,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:53,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:53,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:53,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:15:53,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:15:53,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:15:53,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:53,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:53,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:53,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:53,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:15:53,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:15:53,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:53,432 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:53,500 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:15:53,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:53,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:53,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:53,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,602 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:53,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 11:15:53,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:53,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:53,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 11:15:53,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:53,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:53,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,722 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:53,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:53,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 11:15:53,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:53,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:53,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:15:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:53,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:53,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:53,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:15:53,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:53,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:53,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:15:53,858 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-11 11:15:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:55,707 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-11 11:15:55,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:55,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 11:15:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:55,708 INFO L225 Difference]: With dead ends: 349 [2019-01-11 11:15:55,708 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 11:15:55,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:15:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 11:15:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-11 11:15:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 11:15:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-11 11:15:56,728 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-11 11:15:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:56,729 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-11 11:15:56,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-11 11:15:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:56,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:56,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:56,730 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:56,730 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-11 11:15:56,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:56,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:56,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:56,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:56,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:56,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:15:56,860 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 11:15:56,860 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:56,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:56,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:56,862 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:56,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:56,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:56,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:56,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:56,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:56,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:56,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:15:56,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:15:56,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:15:56,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:15:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:56,957 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,026 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:15:57,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:57,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:57,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,125 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:57,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 11:15:57,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:57,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:15:57,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-11 11:15:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:57,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:57,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:57,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:15:57,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:15:57,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:15:57,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:57,296 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-11 11:15:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:58,745 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-11 11:15:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:58,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:15:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:58,747 INFO L225 Difference]: With dead ends: 257 [2019-01-11 11:15:58,747 INFO L226 Difference]: Without dead ends: 250 [2019-01-11 11:15:58,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-11 11:15:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-11 11:15:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-11 11:15:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-11 11:15:59,804 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-11 11:15:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:59,804 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-11 11:15:59,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:15:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-11 11:15:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:15:59,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:59,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:59,805 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-11 11:15:59,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:59,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:00,008 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 11:16:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:00,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:00,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:00,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:00,071 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-11 11:16:00,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:00,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:00,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:00,074 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:00,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:00,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:00,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:00,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:00,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:00,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:00,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:00,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:00,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:00,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:00,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:00,223 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:00,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:00,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:00,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:00,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:16:00,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:00,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:00,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,437 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:00,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:16:00,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:00,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:16:00,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:00,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:00,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-11 11:16:00,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:00,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:00,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:16:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:00,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:00,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:00,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:16:00,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:00,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:16:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:16:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:00,693 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-11 11:16:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:02,662 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-11 11:16:02,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:16:02,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:16:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:02,664 INFO L225 Difference]: With dead ends: 316 [2019-01-11 11:16:02,664 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 11:16:02,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 11:16:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-11 11:16:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-11 11:16:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-11 11:16:03,768 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-11 11:16:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:03,768 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-11 11:16:03,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:16:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-11 11:16:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:03,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:03,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:03,769 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-11 11:16:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:03,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:03,966 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 11:16:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:04,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:04,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:04,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:04,019 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-11 11:16:04,019 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:04,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:04,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:04,022 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:04,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:04,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:04,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:04,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:04,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:04,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:04,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:04,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:04,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:04,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:04,149 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:04,232 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:04,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,454 INFO L303 Elim1Store]: Index analysis took 202 ms [2019-01-11 11:16:04,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:04,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:04,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:04,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,537 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:04,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:16:04,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:04,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:04,616 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:04,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:16:04,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:04,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:04,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:04,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:04,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:04,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:16:04,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:16:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:16:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:04,744 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-11 11:16:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:06,226 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-11 11:16:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:06,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:16:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:06,227 INFO L225 Difference]: With dead ends: 253 [2019-01-11 11:16:06,227 INFO L226 Difference]: Without dead ends: 246 [2019-01-11 11:16:06,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:06,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-11 11:16:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-11 11:16:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-11 11:16:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-11 11:16:07,334 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-11 11:16:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:07,335 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-11 11:16:07,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:16:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-11 11:16:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:07,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:07,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:07,335 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-11 11:16:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:07,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:07,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:07,920 WARN L181 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-11 11:16:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:16:08,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:08,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:08,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:08,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:08,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:08,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:08,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:08,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:08,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:16:08,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:08,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:08,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:08,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:08,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:08,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:08,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:08,099 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:08,182 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:08,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:08,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:08,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:08,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:16:08,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:08,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:08,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,430 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:08,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:16:08,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:08,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:08,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:08,527 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:08,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:16:08,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:08,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:08,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:08,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:08,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:08,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:16:08,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:08,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:08,697 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-11 11:16:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:10,818 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-11 11:16:10,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:16:10,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-11 11:16:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:10,820 INFO L225 Difference]: With dead ends: 332 [2019-01-11 11:16:10,820 INFO L226 Difference]: Without dead ends: 328 [2019-01-11 11:16:10,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:16:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-11 11:16:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-11 11:16:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-11 11:16:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-11 11:16:11,891 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-11 11:16:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:11,891 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-11 11:16:11,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-11 11:16:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:11,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:11,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:11,892 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:11,892 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-11 11:16:11,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:11,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:16:11,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:11,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:12,469 WARN L181 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-11 11:16:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:16:12,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:12,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:12,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:12,514 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-11 11:16:12,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:12,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:12,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:12,517 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:12,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:12,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:12,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:12,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:12,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:12,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:12,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:12,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:12,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:12,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:12,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:12,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:12,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:12,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:12,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:12,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,760 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:12,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:16:12,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:12,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:12,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:12,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:16:12,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:12,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:12,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:12,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:12,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:12,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:16:12,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:12,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:16:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:16:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:12,970 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-11 11:16:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:14,453 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-11 11:16:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:14,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:16:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:14,454 INFO L225 Difference]: With dead ends: 242 [2019-01-11 11:16:14,454 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 11:16:14,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 11:16:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-11 11:16:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:16:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-11 11:16:15,579 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-11 11:16:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:15,579 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-11 11:16:15,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:16:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-11 11:16:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:15,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:15,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:15,580 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:15,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-11 11:16:15,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:15,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:15,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:15,737 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-11 11:16:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:15,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:15,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:15,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:15,798 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 11:16:15,799 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:15,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:15,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:15,801 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:15,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:15,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:15,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:15,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:15,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:15,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:15,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:15,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:16:15,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:16:15,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:16:15,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:16:15,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:15,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:15,953 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:16:15,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:15,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:16:15,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:16,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:16,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:16:16,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,048 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:16,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 11:16:16,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:16,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:16,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:16:16,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:16,213 INFO L303 Elim1Store]: Index analysis took 116 ms [2019-01-11 11:16:16,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:16:16,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:16,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:16,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:16:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:16,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:16,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:16,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:16,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:16,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:16,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:16,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:16,322 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-11 11:16:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:17,910 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-11 11:16:17,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:17,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:16:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:17,912 INFO L225 Difference]: With dead ends: 254 [2019-01-11 11:16:17,912 INFO L226 Difference]: Without dead ends: 245 [2019-01-11 11:16:17,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-11 11:16:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-11 11:16:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 11:16:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-11 11:16:19,013 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-11 11:16:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:19,013 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-11 11:16:19,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-11 11:16:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:19,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:19,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:19,014 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-11 11:16:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:19,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:19,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:19,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:19,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:19,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:19,129 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-11 11:16:19,129 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:19,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:19,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:19,131 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:19,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:19,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:19,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:19,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:19,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:19,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:19,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:16:19,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:16:19,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:16:19,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:16:19,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,199 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:19,246 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:16:19,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:16:19,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:19,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:16:19,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,353 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:19,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 11:16:19,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:19,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:16:19,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 11:16:19,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:19,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:19,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:16:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:19,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:19,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:19,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:19,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:19,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:19,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:19,518 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-11 11:16:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:21,025 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-11 11:16:21,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:21,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:16:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:21,027 INFO L225 Difference]: With dead ends: 249 [2019-01-11 11:16:21,027 INFO L226 Difference]: Without dead ends: 248 [2019-01-11 11:16:21,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-11 11:16:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-11 11:16:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-11 11:16:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-11 11:16:22,185 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-11 11:16:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:22,185 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-11 11:16:22,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-11 11:16:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:22,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:22,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:22,186 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-11 11:16:22,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:22,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:22,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:22,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:22,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:22,260 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-11 11:16:22,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:22,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:22,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:22,262 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:22,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:22,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:22,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:22,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:22,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:22,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:22,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:22,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:22,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:22,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:22,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,351 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:22,392 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:22,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:22,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:22,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:22,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:22,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:16:22,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:22,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:22,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:22,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:22,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:22,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:16:22,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:22,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:16:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:16:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:16:22,683 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-11 11:16:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:24,022 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-11 11:16:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:16:24,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-11 11:16:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:24,024 INFO L225 Difference]: With dead ends: 239 [2019-01-11 11:16:24,024 INFO L226 Difference]: Without dead ends: 230 [2019-01-11 11:16:24,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:16:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-11 11:16:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-11 11:16:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 11:16:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-11 11:16:25,158 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-11 11:16:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:25,159 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-11 11:16:25,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:16:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-11 11:16:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:16:25,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:25,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:25,159 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-11 11:16:25,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:25,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:25,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:25,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:25,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:25,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:25,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:25,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:16:25,232 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-11 11:16:25,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:25,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:25,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:25,234 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:25,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:25,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:25,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:25,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:25,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:25,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:25,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:25,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:25,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:16:25,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:16:25,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:16:25,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:16:25,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:25,361 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:16:25,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:16:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:25,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:16:25,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:16:25,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:25,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:16:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:25,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:25,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:25,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 11:16:25,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:25,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:16:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:16:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:16:25,530 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-11 11:16:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:26,788 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-11 11:16:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:16:26,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-11 11:16:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:26,790 INFO L225 Difference]: With dead ends: 236 [2019-01-11 11:16:26,790 INFO L226 Difference]: Without dead ends: 227 [2019-01-11 11:16:26,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:16:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-11 11:16:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-11 11:16:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 11:16:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-11 11:16:27,909 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-11 11:16:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:27,909 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-11 11:16:27,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:16:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-11 11:16:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:27,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:27,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:27,910 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-11 11:16:27,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:27,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:27,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:27,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:27,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:16:27,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:27,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:27,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:16:27,999 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 11:16:28,000 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:28,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:28,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:28,002 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:28,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:28,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:28,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:28,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:28,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:28,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:28,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:16:28,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:16:28,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:16:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:16:28,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:28,129 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:16:28,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:16:28,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:28,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:16:28,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-11 11:16:28,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:28,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:16:28,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:28,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:16:28,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:28,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:28,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-11 11:16:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:28,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:28,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:28,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:16:28,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:28,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:16:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:16:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:28,389 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-11 11:16:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:29,700 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-11 11:16:29,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:29,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 11:16:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:29,702 INFO L225 Difference]: With dead ends: 236 [2019-01-11 11:16:29,702 INFO L226 Difference]: Without dead ends: 227 [2019-01-11 11:16:29,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:16:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-11 11:16:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-11 11:16:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-11 11:16:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-11 11:16:30,826 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-11 11:16:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:30,827 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-11 11:16:30,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:16:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-11 11:16:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:30,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:30,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:30,828 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:30,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:30,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-11 11:16:30,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:30,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:30,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:30,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:30,972 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-01-11 11:16:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:31,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:31,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:31,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:16:31,090 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:16:31,091 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:31,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:31,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:31,092 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:16:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:31,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:31,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:31,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:31,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:31,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:31,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:31,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:31,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:31,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:31,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:31,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:31,379 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:31,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:16:31,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:31,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:31,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 11:16:31,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:31,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:31,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,586 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:31,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 11:16:31,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:31,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:31,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:31,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:31,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:16:31,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:31,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:31,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:31,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:31,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:31,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:16:31,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:31,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:16:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:16:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:16:31,830 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-11 11:16:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:33,930 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-11 11:16:33,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:33,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:16:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:33,932 INFO L225 Difference]: With dead ends: 326 [2019-01-11 11:16:33,932 INFO L226 Difference]: Without dead ends: 316 [2019-01-11 11:16:33,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:16:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-11 11:16:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-11 11:16:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-11 11:16:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-11 11:16:35,112 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-11 11:16:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:35,112 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-11 11:16:35,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:16:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-11 11:16:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:35,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:35,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:35,113 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-11 11:16:35,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:35,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:35,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:35,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:35,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:35,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:35,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:35,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:16:35,234 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:16:35,234 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:35,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:35,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:35,236 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:35,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:35,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:35,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:35,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:35,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:35,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:35,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:35,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:16:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:16:35,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:16:35,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:16:35,293 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:35,363 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:16:35,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:16:35,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:35,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:16:35,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,449 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:35,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:16:35,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:35,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:16:35,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:35,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:16:35,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:35,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:35,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:16:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:35,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:35,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:35,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:16:35,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:35,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:35,607 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-11 11:16:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:37,526 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-11 11:16:37,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:37,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:16:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:37,528 INFO L225 Difference]: With dead ends: 288 [2019-01-11 11:16:37,528 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:16:37,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:16:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-11 11:16:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-11 11:16:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-11 11:16:39,165 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-11 11:16:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:39,165 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-11 11:16:39,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-11 11:16:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:39,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:39,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:39,167 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:39,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-11 11:16:39,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:39,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:39,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:39,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:39,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:16:39,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:39,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:39,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:16:39,308 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 11:16:39,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:39,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:39,310 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:39,310 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:39,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:39,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:39,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:39,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:39,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:39,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:39,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:16:39,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:16:39,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:16:39,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:16:39,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,373 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:39,419 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:16:39,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:16:39,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:39,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:16:39,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 11:16:39,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:39,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:16:39,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,570 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:39,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 11:16:39,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:39,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:16:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:39,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:39,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:39,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:16:39,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:39,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:16:39,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:16:39,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:39,680 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-11 11:16:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:41,632 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-11 11:16:41,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:41,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 11:16:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:41,634 INFO L225 Difference]: With dead ends: 277 [2019-01-11 11:16:41,634 INFO L226 Difference]: Without dead ends: 268 [2019-01-11 11:16:41,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-11 11:16:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-11 11:16:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-11 11:16:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-11 11:16:43,355 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-11 11:16:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:43,355 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-11 11:16:43,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:16:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-11 11:16:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:43,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:43,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:43,356 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-11 11:16:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:43,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:43,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:43,576 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-01-11 11:16:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:43,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:43,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:43,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:16:43,693 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-11 11:16:43,694 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:43,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:43,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:43,695 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:16:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:43,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:43,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:43,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:43,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:43,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:43,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:43,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:43,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:43,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:43,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:43,739 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,768 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,824 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:43,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:43,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:43,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:43,947 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:43,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:16:43,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:43,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:43,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:44,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:16:44,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:44,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:44,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:16:44,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:44,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:16:44,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:44,216 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:44,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:16:44,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:44,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:44,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:16:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:44,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:44,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:44,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:16:44,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:44,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:16:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:16:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:44,410 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-11 11:16:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:47,381 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-11 11:16:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:47,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 11:16:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:47,383 INFO L225 Difference]: With dead ends: 361 [2019-01-11 11:16:47,383 INFO L226 Difference]: Without dead ends: 356 [2019-01-11 11:16:47,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:16:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-11 11:16:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-11 11:16:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-11 11:16:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-11 11:16:49,156 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-11 11:16:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:49,156 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-11 11:16:49,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:16:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-11 11:16:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:49,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:49,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:49,157 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:49,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-11 11:16:49,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:49,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:49,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:49,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:49,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:16:49,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:49,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:49,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:49,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:49,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:49,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:49,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:49,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:16:49,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:49,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:49,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:49,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:49,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:49,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:49,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:49,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:49,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:49,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:49,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:49,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:49,497 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:49,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:49,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:49,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:50,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:50,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:50,339 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 11:16:50,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:50,616 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:50,617 INFO L303 Elim1Store]: Index analysis took 274 ms [2019-01-11 11:16:50,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:16:50,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:51,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:51,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:16:51,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:51,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:51,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,186 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:51,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:16:51,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:51,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:51,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:51,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 11:16:51,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:51,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:16:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:51,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:51,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:51,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:16:51,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:51,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:16:51,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:16:51,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:51,508 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-11 11:16:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:54,384 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-11 11:16:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:54,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 11:16:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:54,386 INFO L225 Difference]: With dead ends: 357 [2019-01-11 11:16:54,386 INFO L226 Difference]: Without dead ends: 352 [2019-01-11 11:16:54,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:16:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-11 11:16:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-11 11:16:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 11:16:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-11 11:16:55,928 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-11 11:16:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:55,928 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-11 11:16:55,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:16:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-11 11:16:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:16:55,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:55,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:55,929 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-11 11:16:55,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:55,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:16:55,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:55,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:56,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:56,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:56,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:56,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:56,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:56,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:56,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:16:56,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:16:56,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:16:56,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:56,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:56,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:16:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:16:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:16:56,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:16:56,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:56,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,323 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:16:56,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:16:56,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:56,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:56,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:56,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:16:56,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:56,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:56,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:16:56,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:56,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:16:56,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,620 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:56,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:16:56,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:56,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:56,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:56,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:56,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:16:56,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:56,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:56,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:16:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:56,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:56,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:56,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:16:56,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:56,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:16:56,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:16:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:56,900 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-11 11:16:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:59,189 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-11 11:16:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:59,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-11 11:16:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:59,191 INFO L225 Difference]: With dead ends: 260 [2019-01-11 11:16:59,191 INFO L226 Difference]: Without dead ends: 253 [2019-01-11 11:16:59,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:16:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-11 11:17:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-11 11:17:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-11 11:17:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-11 11:17:00,262 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-11 11:17:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:00,262 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-11 11:17:00,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:17:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-11 11:17:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:00,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:00,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:00,263 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-11 11:17:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:00,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:00,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:00,432 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-11 11:17:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:00,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:00,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:00,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:00,520 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:17:00,521 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:00,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:00,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:00,522 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:00,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:00,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:00,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:00,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:00,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:00,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:00,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:00,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:17:00,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:17:00,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:17:00,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:17:00,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:00,644 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:17:00,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:17:00,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:00,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:17:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:17:00,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:00,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:17:00,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,819 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:00,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 11:17:00,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:00,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:17:00,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:00,888 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:00,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:17:00,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:00,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:00,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:17:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:00,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:01,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:01,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:17:01,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:01,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:17:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:17:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:01,020 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-11 11:17:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:02,936 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-11 11:17:02,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:02,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:17:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:02,937 INFO L225 Difference]: With dead ends: 202 [2019-01-11 11:17:02,938 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 11:17:02,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:17:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 11:17:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-11 11:17:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-11 11:17:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-11 11:17:04,216 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-11 11:17:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:04,216 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-11 11:17:04,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-11 11:17:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:04,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:04,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:04,217 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-11 11:17:04,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:04,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:04,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:04,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:04,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:17:04,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:04,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:04,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:04,389 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 11:17:04,390 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:04,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:04,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:04,391 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:04,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:04,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:04,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:04,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:04,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:04,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:04,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:04,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:04,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:04,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:04,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:04,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,739 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:04,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:04,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:04,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:04,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:04,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:04,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:17:04,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:05,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:05,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,042 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:05,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:17:05,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:05,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:05,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:05,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:05,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:05,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:17:05,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:05,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:05,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:05,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:05,185 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-11 11:17:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:07,081 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-11 11:17:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:17:07,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:17:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:07,083 INFO L225 Difference]: With dead ends: 199 [2019-01-11 11:17:07,083 INFO L226 Difference]: Without dead ends: 192 [2019-01-11 11:17:07,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:17:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-11 11:17:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-11 11:17:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-11 11:17:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-11 11:17:08,282 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-11 11:17:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:08,283 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-11 11:17:08,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:17:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-11 11:17:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:08,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:08,283 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:08,283 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:08,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-11 11:17:08,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:08,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:08,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:08,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:08,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:08,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:08,351 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-11 11:17:08,352 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:08,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:08,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:08,354 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:17:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:08,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:08,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:08,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:08,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:08,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:08,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:08,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:08,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:17:08,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:17:08,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:17:08,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:17:08,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,430 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:08,478 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-11 11:17:08,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:17:08,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:08,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:17:08,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 11:17:08,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:08,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:17:08,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:08,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:17:08,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:08,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:08,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-11 11:17:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:08,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:08,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:08,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:17:08,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:08,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:17:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:17:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:17:08,740 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-11 11:17:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:10,392 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-11 11:17:10,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:17:10,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 11:17:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:10,394 INFO L225 Difference]: With dead ends: 196 [2019-01-11 11:17:10,394 INFO L226 Difference]: Without dead ends: 187 [2019-01-11 11:17:10,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:17:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-11 11:17:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-11 11:17:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 11:17:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-11 11:17:11,843 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-11 11:17:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:11,843 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-11 11:17:11,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:17:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-11 11:17:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:11,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:11,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:11,844 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-11 11:17:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:11,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:11,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:11,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:17:11,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:11,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:11,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:11,951 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 11:17:11,951 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:11,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:11,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:11,953 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:11,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:11,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:11,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:11,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:11,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:11,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:11,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:11,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:11,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:11,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:11,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:12,079 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:12,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:12,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:12,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:17:12,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:12,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:12,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:12,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 11:17:12,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:12,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:12,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 11:17:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:12,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:12,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:12,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-11 11:17:12,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:12,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:17:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:17:12,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:17:12,424 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-11 11:17:12,975 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-11 11:17:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:14,625 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-11 11:17:14,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:17:14,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-11 11:17:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:14,627 INFO L225 Difference]: With dead ends: 203 [2019-01-11 11:17:14,627 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 11:17:14,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:17:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 11:17:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-11 11:17:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 11:17:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-11 11:17:16,168 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-11 11:17:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:16,168 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-11 11:17:16,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:17:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-11 11:17:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:16,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:16,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:16,169 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-11 11:17:16,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:16,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:16,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:16,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:16,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:16,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:16,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:16,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:16,316 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 11:17:16,316 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:16,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:16,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:16,318 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:16,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:16,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:16,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:16,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:16,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:16,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:16,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:16,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:16,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:16,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:16,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:16,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:16,454 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:16,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:16,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:16,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:16,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:16,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:16,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:16,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,670 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:16,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:17:16,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:16,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:16,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:16,762 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:16,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:16,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:16,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:16,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:16,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:17:16,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:16,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:16,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:16,901 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-11 11:17:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:19,470 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-11 11:17:19,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:19,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:17:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:19,472 INFO L225 Difference]: With dead ends: 269 [2019-01-11 11:17:19,472 INFO L226 Difference]: Without dead ends: 265 [2019-01-11 11:17:19,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:17:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-11 11:17:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-11 11:17:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 11:17:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-11 11:17:21,318 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-11 11:17:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-11 11:17:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:17:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-11 11:17:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:21,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:21,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:21,319 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:21,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-11 11:17:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:21,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:21,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:21,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:21,458 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:21,458 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-11 11:17:21,459 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:21,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:21,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:21,460 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:17:21,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:21,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:21,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:21,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:21,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:21,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:21,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:21,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:21,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:21,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:21,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:21,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:21,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,530 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:21,586 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:21,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:21,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:21,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:21,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:21,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:21,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:21,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,813 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:21,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:17:21,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:21,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:21,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,909 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:21,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-11 11:17:21,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:21,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:21,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:22,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:17:22,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:22,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:22,054 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-11 11:17:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:24,622 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-11 11:17:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:24,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:17:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:24,624 INFO L225 Difference]: With dead ends: 253 [2019-01-11 11:17:24,624 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 11:17:24,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:17:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 11:17:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-11 11:17:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-11 11:17:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-11 11:17:26,511 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-11 11:17:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:26,511 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-11 11:17:26,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:17:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-11 11:17:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:26,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:26,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:26,512 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-11 11:17:26,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:26,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:26,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:26,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:17:26,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:26,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:26,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:17:26,605 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-11 11:17:26,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:26,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:26,607 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:26,607 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:26,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:26,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:26,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:26,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:26,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:26,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:26,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:26,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:26,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:26,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:26,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:26,740 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:26,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:26,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:26,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:26,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:26,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:26,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:26,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:26,940 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:26,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 11:17:26,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:26,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:26,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:27,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:27,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:27,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-11 11:17:27,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:27,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:17:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:17:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:17:27,077 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-11 11:17:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:29,251 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-11 11:17:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:17:29,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-11 11:17:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:29,253 INFO L225 Difference]: With dead ends: 226 [2019-01-11 11:17:29,253 INFO L226 Difference]: Without dead ends: 217 [2019-01-11 11:17:29,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:17:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-11 11:17:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-11 11:17:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-11 11:17:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-11 11:17:31,094 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-11 11:17:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:31,094 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-11 11:17:31,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:17:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-11 11:17:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:31,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:31,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:31,095 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:31,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-11 11:17:31,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:31,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:31,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:31,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:31,312 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-11 11:17:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:17:31,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:31,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:31,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:31,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:31,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:31,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:31,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:31,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:31,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:17:31,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:31,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:31,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:31,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:31,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:31,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:31,475 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:31,558 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:31,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:31,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:31,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:31,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,681 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:31,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-11 11:17:31,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:31,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:31,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-11 11:17:31,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:31,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:31,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:31,853 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:31,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:31,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:31,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:31,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:31,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:32,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:32,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:17:32,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:32,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:17:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:17:32,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:32,018 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-11 11:17:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:34,665 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-11 11:17:34,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:34,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:17:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:34,667 INFO L225 Difference]: With dead ends: 258 [2019-01-11 11:17:34,667 INFO L226 Difference]: Without dead ends: 251 [2019-01-11 11:17:34,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:17:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-11 11:17:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-11 11:17:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 11:17:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-11 11:17:36,537 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-11 11:17:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:36,538 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-11 11:17:36,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-11 11:17:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:36,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:36,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:36,538 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-11 11:17:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:36,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:36,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:36,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:36,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:36,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:36,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:36,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:36,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:36,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:36,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:36,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:17:36,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:36,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:36,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:36,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:17:36,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:17:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:17:36,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:17:36,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,827 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:36,876 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-11 11:17:36,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:17:36,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:36,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-11 11:17:36,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,986 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:36,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-11 11:17:36,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:37,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:37,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-11 11:17:37,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 11:17:37,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:37,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:37,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-11 11:17:37,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:37,115 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:37,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 11:17:37,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:37,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:37,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-11 11:17:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:37,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:37,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:37,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:17:37,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:37,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:17:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:17:37,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:37,242 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-11 11:17:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:40,110 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-11 11:17:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:40,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:17:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:40,111 INFO L225 Difference]: With dead ends: 279 [2019-01-11 11:17:40,111 INFO L226 Difference]: Without dead ends: 272 [2019-01-11 11:17:40,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:17:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-11 11:17:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-11 11:17:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-11 11:17:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-11 11:17:42,192 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-11 11:17:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:42,193 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-11 11:17:42,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-11 11:17:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:17:42,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:42,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:42,193 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-11 11:17:42,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:42,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:42,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:42,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:42,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:42,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:42,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:42,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:42,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:42,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:42,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:42,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:17:42,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:42,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:42,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:42,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:42,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:42,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:42,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:42,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:42,509 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:42,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:42,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:42,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:42,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:42,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-11 11:17:42,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:42,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:42,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 11:17:42,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:42,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:42,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:42,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:42,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-11 11:17:42,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:42,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:42,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:42,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:42,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:42,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:17:42,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:42,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:17:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:17:42,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:42,969 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-11 11:17:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:45,729 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-11 11:17:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:45,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:17:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:45,731 INFO L225 Difference]: With dead ends: 256 [2019-01-11 11:17:45,731 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 11:17:45,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:17:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 11:17:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-11 11:17:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 11:17:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-11 11:17:47,791 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-11 11:17:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:47,791 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-11 11:17:47,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:17:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-11 11:17:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:17:47,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:47,792 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:47,792 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:47,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-11 11:17:47,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:47,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:47,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:17:47,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:47,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:47,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:47,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:47,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:47,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:47,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:47,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:47,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:17:47,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:47,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:47,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:47,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:17:47,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:47,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:17:47,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:47,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:47,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-11 11:17:47,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:47,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:47,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:17:47,970 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:47,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:48,038 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-11 11:17:48,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 11:17:48,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:48,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-11 11:17:48,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:17:48,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:48,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-11 11:17:48,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:48,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 11:17:48,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:48,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-11 11:17:48,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-01-11 11:17:48,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:48,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-11 11:17:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:48,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:48,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:48,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:17:48,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:48,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:17:48,390 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-11 11:17:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:50,836 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-11 11:17:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:50,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-11 11:17:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:50,838 INFO L225 Difference]: With dead ends: 234 [2019-01-11 11:17:50,838 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 11:17:50,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:17:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 11:17:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-11 11:17:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:17:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-11 11:17:51,308 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-11 11:17:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:51,309 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-11 11:17:51,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:17:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-11 11:17:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:17:51,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:51,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:51,309 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:51,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:51,309 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-11 11:17:51,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:51,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:51,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:51,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:51,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:51,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:51,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:17:51,558 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:17:51,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:51,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:51,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:51,560 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:17:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:51,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:51,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:51,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:51,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:51,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:51,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:51,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:51,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:51,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:51,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:51,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:51,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,685 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:51,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:51,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:51,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:51,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,816 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:51,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:17:51,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:51,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:51,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:51,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:51,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:51,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:51,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:51,993 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:51,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:17:51,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:52,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:52,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:52,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:52,095 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:52,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:52,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:52,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:52,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:52,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:52,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:52,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:17:52,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:52,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:17:52,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:17:52,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:17:52,281 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-11 11:17:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:53,643 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-11 11:17:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:17:53,643 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-11 11:17:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:53,644 INFO L225 Difference]: With dead ends: 76 [2019-01-11 11:17:53,644 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:17:53,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-11 11:17:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:17:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-11 11:17:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 11:17:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-11 11:17:54,172 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-11 11:17:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:54,172 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-11 11:17:54,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:17:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-11 11:17:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:17:54,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:54,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:54,173 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:54,173 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-11 11:17:54,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:54,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:54,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:54,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:54,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:54,520 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-01-11 11:17:54,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:54,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:54,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:54,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:54,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:54,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:54,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:54,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:54,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:54,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:17:54,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:54,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:54,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:54,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:54,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:54,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:54,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,727 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,783 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:54,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:54,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:54,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:54,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:54,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:54,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,994 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:54,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:17:54,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:55,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:55,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:55,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:55,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:55,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:55,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,187 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:55,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:55,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:55,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:55,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:55,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:17:55,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:55,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:17:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:17:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:17:55,362 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-11 11:17:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:56,679 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-11 11:17:56,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:17:56,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 11:17:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:56,680 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:17:56,680 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:17:56,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:17:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:17:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-11 11:17:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:17:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-11 11:17:57,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-11 11:17:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:57,181 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-11 11:17:57,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:17:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-11 11:17:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:17:57,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:57,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:57,181 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:57,182 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-11 11:17:57,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:57,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:57,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:57,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:57,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:57,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:57,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:57,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:57,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:57,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:57,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:17:57,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:17:57,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:17:57,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:57,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:57,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:17:57,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:57,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:17:57,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:17:57,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:17:57,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:17:57,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:57,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:57,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:57,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 11:17:57,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:57,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:57,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,832 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:57,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-11 11:17:57,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:57,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-11 11:17:57,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:57,927 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:57,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:57,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:57,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:57,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:58,020 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:58,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:17:58,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:58,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:58,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:17:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:58,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:58,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:58,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:17:58,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:17:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:17:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:17:58,193 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-11 11:18:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:00,014 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-11 11:18:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:18:00,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-11 11:18:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:00,015 INFO L225 Difference]: With dead ends: 97 [2019-01-11 11:18:00,015 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:18:00,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:18:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:18:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-11 11:18:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 11:18:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-11 11:18:00,804 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-11 11:18:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:00,804 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-11 11:18:00,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:18:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-11 11:18:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:18:00,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:00,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:00,805 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:00,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-11 11:18:00,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:00,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:18:00,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:00,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:18:01,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:01,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:01,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:18:01,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:18:01,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:01,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:01,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:01,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:01,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:01,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:18:01,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:18:01,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:18:01,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:18:01,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:18:01,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,188 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-11 11:18:01,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:18:01,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:01,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:01,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,314 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:01,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-11 11:18:01,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:01,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-11 11:18:01,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 11:18:01,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:01,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-11 11:18:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:01,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:18:01,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:01,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-11 11:18:01,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:01,634 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:01,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-11 11:18:01,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:01,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:01,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:18:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:01,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 11:18:01,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:01,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:18:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:18:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:18:01,814 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-11 11:18:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:03,352 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-11 11:18:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:18:03,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 11:18:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:03,353 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:18:03,353 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:18:03,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:18:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:18:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:18:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:18:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:18:03,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-11 11:18:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:18:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:18:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:18:03,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:18:03,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:18:03,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:03,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:03,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:03,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:04,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:05,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:06,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:10,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:11,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:12,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:16,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:16,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:16,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:17,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:17,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:21,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:22,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:23,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:25,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:35,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:36,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:36,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:36,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:36,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:36,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:41,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:18:54,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:01,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:02,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:02,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:02,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:09,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:09,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:10,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:10,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:10,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:10,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:18,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:18,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:21,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:21,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:21,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:21,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:21,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:21,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:19:28,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:09,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:23,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:23,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:23,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:43,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:43,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:43,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:20:46,930 WARN L181 SmtUtils]: Spent 2.73 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-11 11:24:43,163 WARN L181 SmtUtils]: Spent 3.94 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-11 11:24:43,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-11 11:24:43,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-11 11:24:43,168 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-11 11:24:43,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-11 11:24:43,196 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 11:24:43 BoogieIcfgContainer [2019-01-11 11:24:43,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 11:24:43,197 INFO L168 Benchmark]: Toolchain (without parser) took 709683.18 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 108.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-01-11 11:24:43,198 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:24:43,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.85 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:24:43,201 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:24:43,201 INFO L168 Benchmark]: RCFGBuilder took 415.60 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 93.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-01-11 11:24:43,202 INFO L168 Benchmark]: TraceAbstraction took 709184.98 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 92.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-01-11 11:24:43,206 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.85 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.03 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.60 ms. Allocated memory is still 140.5 MB. Free memory was 104.1 MB in the beginning and 93.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 709184.98 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 92.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 709.0s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 141.9s AutomataDifference, 0.0s DeadEndRemovalTime, 399.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 59.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 61.6s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 163.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 236.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 98.6s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...