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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:38:29,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:38:29,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:38:29,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:38:29,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:38:29,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:38:29,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:38:29,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:38:29,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:38:29,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:38:29,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:38:29,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:38:29,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:38:29,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:38:29,136 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:38:29,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:38:29,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:38:29,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:38:29,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:38:29,144 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:38:29,145 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:38:29,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:38:29,149 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:38:29,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:38:29,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:38:29,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:38:29,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:38:29,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:38:29,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:38:29,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:38:29,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:38:29,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:38:29,156 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:38:29,156 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:38:29,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:38:29,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:38:29,159 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:38:29,171 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:38:29,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:38:29,173 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:38:29,173 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:38:29,173 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:38:29,173 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:38:29,173 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:38:29,174 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:38:29,174 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:38:29,174 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:38:29,174 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:38:29,175 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:38:29,175 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:38:29,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:38:29,176 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:38:29,176 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:38:29,176 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:38:29,176 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:38:29,177 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:38:29,177 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:38:29,177 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:38:29,177 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:38:29,177 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:38:29,177 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:38:29,178 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:38:29,178 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:38:29,178 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:38:29,178 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:38:29,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:38:29,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:38:29,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:29,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:38:29,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:38:29,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:38:29,180 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:38:29,180 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:38:29,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:38:29,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:38:29,181 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:38:29,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:38:29,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:38:29,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:38:29,228 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:38:29,229 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:38:29,230 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-01-20 10:38:29,230 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-20 10:38:29,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:38:29,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:38:29,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:29,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:38:29,273 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:38:29,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:29,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:38:29,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:38:29,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:38:29,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... [2019-01-20 10:38:29,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:38:29,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:38:29,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:38:29,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:38:29,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:38:29,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:38:29,730 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:38:29,731 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-20 10:38:29,732 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:29 BoogieIcfgContainer [2019-01-20 10:38:29,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:38:29,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:38:29,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:38:29,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:38:29,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:29" (1/2) ... [2019-01-20 10:38:29,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f52ea3 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:38:29, skipping insertion in model container [2019-01-20 10:38:29,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:29" (2/2) ... [2019-01-20 10:38:29,740 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-20 10:38:29,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:38:29,758 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-20 10:38:29,775 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-20 10:38:29,810 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:38:29,810 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:38:29,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:38:29,810 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:38:29,811 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:38:29,811 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:38:29,811 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:38:29,811 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:38:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-20 10:38:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:38:29,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:29,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:38:29,837 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-20 10:38:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:29,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:29,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:29,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:30,077 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-20 10:38:30,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:30,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:30,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:30,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:30,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:30,108 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-20 10:38:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:30,289 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-20 10:38:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:30,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:38:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:30,306 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:38:30,306 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 10:38:30,310 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-20 10:38:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 10:38:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-20 10:38:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 10:38:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-20 10:38:30,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-20 10:38:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:30,348 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-20 10:38:30,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-20 10:38:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:30,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:30,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:30,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-20 10:38:30,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:30,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:30,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:30,489 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-20 10:38:30,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:30,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:30,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:30,493 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-20 10:38:30,547 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:30,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:34,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:34,206 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:34,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:34,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:34,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:34,215 INFO 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-20 10:38:34,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:34,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:34,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:34,460 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-20 10:38:34,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:34,512 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 18 treesize of output 24 [2019-01-20 10:38:34,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:34,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:34,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:34,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:34,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:34,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:34,597 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 22 treesize of output 45 [2019-01-20 10:38:34,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:34,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:34,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:34,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:34,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:34,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:35,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:35,255 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-20 10:38:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:35,269 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:35,305 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:35,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:35,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:35,380 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:35,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:38:35,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:35,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:35,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:35,643 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-20 10:38:35,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:35,677 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-20 10:38:35,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:35,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:35,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:35,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:35,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:35,700 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-20 10:38:36,005 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-20 10:38:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:36,238 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-20 10:38:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:36,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:38:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:36,241 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:38:36,241 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:38:36,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:38:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-20 10:38:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:38:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-20 10:38:36,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-20 10:38:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:36,248 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-20 10:38:36,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-20 10:38:36,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:36,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:36,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:36,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:36,250 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-20 10:38:36,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:36,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:36,316 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-20 10:38:36,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:36,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:36,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:36,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:36,318 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-20 10:38:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:36,358 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-20 10:38:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:36,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:36,359 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:38:36,359 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 10:38:36,359 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-20 10:38:36,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 10:38:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-20 10:38:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:38:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-20 10:38:36,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-20 10:38:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:36,364 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-20 10:38:36,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-20 10:38:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:36,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:36,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:36,366 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-20 10:38:36,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:36,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:36,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:36,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:36,431 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-20 10:38:36,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:36,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:36,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:36,432 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-20 10:38:36,435 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:36,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:36,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:36,745 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:36,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:36,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:36,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:38:36,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:36,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:36,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:36,914 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-20 10:38:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:36,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:36,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,019 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 20 treesize of output 34 [2019-01-20 10:38:37,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:38:37,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:37,960 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 10:38:37,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-20 10:38:37,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,978 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:37,995 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-20 10:38:38,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:38,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:38:38,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:38,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:38,083 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-20 10:38:38,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:38,093 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-20 10:38:38,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:38,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:38:38,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:38,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:38,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:38,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:38,114 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-20 10:38:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:38,212 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-20 10:38:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:38:38,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:38:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:38,213 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:38:38,213 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:38:38,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:38:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-20 10:38:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:38:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-20 10:38:38,218 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-20 10:38:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:38,219 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-20 10:38:38,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-20 10:38:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:38,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:38,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:38,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-20 10:38:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:38,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:38,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:38,318 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-20 10:38:38,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:38,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:38,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:38,319 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-20 10:38:38,322 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:38,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:38,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:38,542 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:38,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:38,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38: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 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-20 10:38:38,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:38,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:38,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:38,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:38,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:38,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:38,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:38,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-20 10:38:38,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:38,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:38,788 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 20 treesize of output 34 [2019-01-20 10:38:38,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:38:38,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,853 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:38,922 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-20 10:38:38,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:38,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:38:38,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:38,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:39,004 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-20 10:38:39,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:39,019 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-20 10:38:39,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:39,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:39,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:39,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:39,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:39,039 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-20 10:38:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:39,180 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-20 10:38:39,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:39,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:38:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:39,182 INFO L225 Difference]: With dead ends: 32 [2019-01-20 10:38:39,182 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:38:39,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:38:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-20 10:38:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:38:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-20 10:38:39,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-20 10:38:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:39,188 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-20 10:38:39,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-20 10:38:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:39,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:39,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:39,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:39,189 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-20 10:38:39,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:39,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:39,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:39,286 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-20 10:38:39,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:39,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:39,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:39,287 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-20 10:38:39,289 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:39,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:41,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:41,308 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:41,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:41,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:41,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:38:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:41,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:41,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:41,513 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-20 10:38:41,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:41,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:41,856 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:38:41,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:41,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:41,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:42,344 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-20 10:38:42,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:42,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:42,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:42,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:42,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:42,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:42,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:42,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:42,507 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 22 treesize of output 45 [2019-01-20 10:38:42,507 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,564 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,573 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:42,602 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:42,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:42,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, 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-20 10:38:42,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:42,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:42,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:42,678 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-20 10:38:42,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:42,687 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-20 10:38:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:42,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:38:42,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:42,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:42,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:38:42,707 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-20 10:38:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:42,740 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-20 10:38:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:42,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:42,741 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:38:42,742 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:38:42,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:38:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:38:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-20 10:38:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:38:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-20 10:38:42,748 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-20 10:38:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:42,748 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-20 10:38:42,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-20 10:38:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:42,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:42,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:42,749 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-20 10:38:42,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:42,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:42,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:42,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:42,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:42,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:42,807 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-20 10:38:42,808 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:42,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:43,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:43,426 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:43,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:43,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:43,426 INFO 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-20 10:38:43,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:43,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:43,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:43,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:43,490 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 18 treesize of output 24 [2019-01-20 10:38:43,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,499 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 20 treesize of output 34 [2019-01-20 10:38:43,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,510 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 22 treesize of output 45 [2019-01-20 10:38:43,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:43,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:43,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:43,634 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:43,670 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:43,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,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, 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-20 10:38:43,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:43,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:43,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,749 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:43,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-20 10:38:43,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:43,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-20 10:38:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:43,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:43,809 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-20 10:38:43,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:43,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:43,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:43,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:43,831 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-20 10:38:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:44,171 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-20 10:38:44,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:44,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:44,173 INFO L225 Difference]: With dead ends: 37 [2019-01-20 10:38:44,173 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:38:44,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:38:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-20 10:38:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:38:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-20 10:38:44,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-20 10:38:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:44,180 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-20 10:38:44,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-20 10:38:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:44,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:44,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:44,181 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-20 10:38:44,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:44,263 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-20 10:38:44,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:44,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:44,264 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:44,264 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-20 10:38:44,265 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:44,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:44,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:44,867 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:44,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:44,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:44,868 INFO 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-20 10:38:44,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:44,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:44,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:44,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:44,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:45,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:45,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:45,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:45,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:45,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:38:45,144 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:45,198 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:45,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,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, 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-20 10:38:45,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:45,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:45,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,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-20 10:38:45,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:45,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:45,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:45,409 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-20 10:38:45,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:45,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:45,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:45,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:45,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:45,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:45,429 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-20 10:38:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:45,767 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-20 10:38:45,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:45,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:45,769 INFO L225 Difference]: With dead ends: 46 [2019-01-20 10:38:45,769 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:38:45,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:38:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-20 10:38:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 10:38:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-20 10:38:45,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-20 10:38:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:45,785 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-20 10:38:45,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-20 10:38:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:45,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:45,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:45,787 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-20 10:38:45,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:45,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:45,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:45,923 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-20 10:38:45,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:45,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:45,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:45,924 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-20 10:38:45,926 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:45,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:46,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:46,477 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:46,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:46,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:46,478 INFO 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-20 10:38:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:46,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:46,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:46,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:46,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 18 treesize of output 24 [2019-01-20 10:38:46,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,530 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 20 treesize of output 34 [2019-01-20 10:38:46,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:38:46,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:46,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:46,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:46,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,685 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:46,725 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:46,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,790 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-20 10:38:46,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:46,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:46,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,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, 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-20 10:38:46,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:46,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:38:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:46,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:46,944 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-20 10:38:46,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:46,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:38:46,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:46,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:46,964 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-20 10:38:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:47,167 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-20 10:38:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:47,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:47,169 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:38:47,170 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 10:38:47,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 10:38:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-20 10:38:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:38:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-20 10:38:47,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-20 10:38:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:47,179 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-20 10:38:47,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-20 10:38:47,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:47,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:47,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:47,180 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-20 10:38:47,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:47,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:47,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:47,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:47,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:47,244 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-20 10:38:47,245 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:47,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:47,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:47,393 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:47,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:47,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:47,393 INFO 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-20 10:38:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:47,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:47,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:47,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:47,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-20 10:38:47,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:47,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:47,498 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 20 treesize of output 34 [2019-01-20 10:38:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:38:47,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:47,544 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-20 10:38:47,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,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, 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-20 10:38:47,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,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-20 10:38:47,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:47,604 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-20 10:38:47,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:47,626 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-20 10:38:47,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:47,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:47,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:47,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:47,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:47,647 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-20 10:38:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:47,833 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-20 10:38:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:47,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:38:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:47,834 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:38:47,835 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:38:47,835 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-20 10:38:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:38:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-20 10:38:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:38:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-20 10:38:47,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-20 10:38:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:47,844 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-20 10:38:47,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-20 10:38:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:47,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:47,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:47,846 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-20 10:38:47,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:47,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:47,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:47,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:47,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:47,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:47,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:47,911 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-20 10:38:47,912 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:47,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:48,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:48,123 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:48,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:48,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:48,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 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-20 10:38:48,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:48,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:48,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:48,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:48,172 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 18 treesize of output 24 [2019-01-20 10:38:48,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,178 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 20 treesize of output 34 [2019-01-20 10:38:48,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,192 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 22 treesize of output 45 [2019-01-20 10:38:48,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:48,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:48,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:48,347 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,355 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:48,384 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:48,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,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, 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-20 10:38:48,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:48,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:48,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:38:48,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:48,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:48,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:48,509 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-20 10:38:48,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:48,530 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-20 10:38:48,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:48,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:48,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:48,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:48,551 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-20 10:38:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:48,860 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-20 10:38:48,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:48,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:48,862 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:38:48,862 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 10:38:48,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 10:38:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-20 10:38:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:38:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-20 10:38:48,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-20 10:38:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:48,874 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-20 10:38:48,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-20 10:38:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:48,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:48,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:48,875 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-20 10:38:48,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:48,915 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-20 10:38:48,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:48,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:48,916 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:48,916 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-20 10:38:48,916 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:48,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:49,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:49,076 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:49,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:49,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:49,076 INFO 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-20 10:38:49,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:49,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:49,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:49,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:49,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:38:49,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-20 10:38:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-20 10:38:49,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:38:49,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:38:49,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:38:49,263 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,379 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:49,405 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-20 10:38:49,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-20 10:38:49,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:49,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-20 10:38:49,487 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-20 10:38:49,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:49,497 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-20 10:38:49,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:49,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:49,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:49,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:49,517 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-20 10:38:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:49,645 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-20 10:38:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:49,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:38:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:49,647 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:38:49,647 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:38:49,647 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-20 10:38:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:38:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-20 10:38:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:38:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-20 10:38:49,657 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-20 10:38:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:49,657 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-20 10:38:49,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-20 10:38:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:49,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:49,658 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:38:49,658 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-20 10:38:49,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:49,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:49,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:49,751 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-20 10:38:49,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:49,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:49,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:38:49,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:38:49,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:49,752 INFO 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-20 10:38:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:38:49,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:38:49,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:38:49,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:38:49,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:49,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:49,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:49,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:49,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:49,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:49,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:49,932 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 22 treesize of output 45 [2019-01-20 10:38:49,933 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,948 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:49,986 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:50,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:38:50,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,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-20 10:38:50,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:50,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,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 33 treesize of output 57 [2019-01-20 10:38:50,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:50,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-20 10:38:50,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,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 59 [2019-01-20 10:38:50,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:50,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:50,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-20 10:38:50,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:50,161 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-20 10:38:50,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:50,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:38:50,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:50,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:38:50,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:38:50,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:50,183 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-20 10:38:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:50,527 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-20 10:38:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:50,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:38:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:50,528 INFO L225 Difference]: With dead ends: 65 [2019-01-20 10:38:50,528 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 10:38:50,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:38:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 10:38:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-20 10:38:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:38:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-20 10:38:50,539 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-20 10:38:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:50,539 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-20 10:38:50,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:38:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-20 10:38:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:50,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:50,540 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:38:50,541 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-20 10:38:50,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:50,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:50,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:38:50,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:50,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:50,652 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-20 10:38:50,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:50,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:50,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:38:50,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:38:50,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:50,653 INFO 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-20 10:38:50,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:38:50,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:38:50,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:38:50,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:38:50,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:50,700 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 18 treesize of output 24 [2019-01-20 10:38:50,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,708 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 20 treesize of output 34 [2019-01-20 10:38:50,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,721 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 22 treesize of output 45 [2019-01-20 10:38:50,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:50,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:50,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:50,872 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,884 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,894 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:50,916 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,938 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-20 10:38:50,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,959 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-20 10:38:50,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:50,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:38:50,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,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-20 10:38:51,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-20 10:38:51,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,051 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-20 10:38:51,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:51,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:51,097 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-20 10:38:51,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:51,163 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-20 10:38:51,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:51,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-20 10:38:51,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:51,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:38:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:38:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:38:51,183 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-20 10:38:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:51,561 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-20 10:38:51,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:51,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:38:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:51,563 INFO L225 Difference]: With dead ends: 53 [2019-01-20 10:38:51,563 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:38:51,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:38:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-20 10:38:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:38:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-20 10:38:51,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-20 10:38:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:51,573 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-20 10:38:51,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:38:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-20 10:38:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:51,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:51,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:51,574 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-20 10:38:51,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:51,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:38:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:51,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:51,629 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-20 10:38:51,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:51,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:51,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:51,630 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-20 10:38:51,632 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:51,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:52,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:52,396 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:52,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:52,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:52,396 INFO 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-20 10:38:52,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:52,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:52,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:52,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:52,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:52,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:52,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:52,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:38:52,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:52,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:38:52,568 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,584 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:52,621 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:52,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,649 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-20 10:38:52,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:52,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:52,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:52,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, 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-20 10:38:52,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:52,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:52,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:52,758 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-20 10:38:52,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:52,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:52,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:52,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:52,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:52,779 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-20 10:38:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:53,041 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-20 10:38:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:53,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:38:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:53,043 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:38:53,043 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:38:53,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:53,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:38:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-20 10:38:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:38:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-20 10:38:53,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-20 10:38:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:53,055 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-20 10:38:53,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-20 10:38:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:53,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:53,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:53,056 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-20 10:38:53,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:53,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:53,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:53,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:53,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:53,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:53,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:53,187 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-20 10:38:53,188 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:53,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:53,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:53,837 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:38:53,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:53,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:53,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:53,838 INFO 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-20 10:38:53,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:53,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:53,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:53,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:53,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 18 treesize of output 24 [2019-01-20 10:38:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:53,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:53,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:38:53,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:53,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:53,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:53,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:53,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:38:53,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:53,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-20 10:38:53,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:54,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-20 10:38:54,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:38:54,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:38:54,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-20 10:38:54,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:100 [2019-01-20 10:38:54,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,318 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:54,318 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-20 10:38:54,319 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 32 treesize of output 45 [2019-01-20 10:38:54,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,673 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:54,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-20 10:38:54,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2019-01-20 10:38:54,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-20 10:38:54,756 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:97, output treesize:63 [2019-01-20 10:38:54,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,800 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 34 treesize of output 44 [2019-01-20 10:38:54,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,845 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:54,845 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 34 treesize of output 44 [2019-01-20 10:38:54,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2019-01-20 10:38:54,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-20 10:38:54,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-20 10:38:54,967 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-20 10:38:54,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:54,982 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-20 10:38:55,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:55,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-20 10:38:55,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:55,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:38:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:38:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:55,002 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-20 10:38:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:55,817 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-20 10:38:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:38:55,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:38:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:55,818 INFO L225 Difference]: With dead ends: 81 [2019-01-20 10:38:55,818 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:38:55,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:38:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:38:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-20 10:38:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:38:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-20 10:38:55,832 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-20 10:38:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:55,832 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-20 10:38:55,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:38:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-20 10:38:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:55,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:55,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:55,834 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-20 10:38:55,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:55,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:55,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:55,899 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-20 10:38:55,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:55,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:55,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:55,900 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-20 10:38:55,901 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:55,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:56,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:56,614 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:38:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:56,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:56,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:56,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:38:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:56,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:56,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:56,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:56,655 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 18 treesize of output 24 [2019-01-20 10:38:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:38:56,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,681 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 22 treesize of output 45 [2019-01-20 10:38:56,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:56,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:56,798 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,807 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,833 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:38:56,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:38:56,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,896 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-20 10:38:56,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:56,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,924 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:56,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-20 10:38:56,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:56,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-20 10:38:57,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,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, 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-20 10:38:57,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:57,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:38:57,101 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-20 10:38:57,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:57,193 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-20 10:38:57,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:57,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:38:57,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:57,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:38:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:38:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:38:57,212 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-20 10:38:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:57,763 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-20 10:38:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:57,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:38:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:57,765 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:38:57,765 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 10:38:57,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:38:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 10:38:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-20 10:38:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:38:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-20 10:38:57,781 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-20 10:38:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:57,781 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-20 10:38:57,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:38:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-20 10:38:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:38:57,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:57,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:38:57,783 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-20 10:38:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:57,847 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-20 10:38:57,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:57,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:57,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:38:57,848 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-20 10:38:57,850 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:57,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:58,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:58,405 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:58,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:58,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:58,406 INFO 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-20 10:38:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:58,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:58,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:58,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:38:58,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:38:58,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:38:58,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:38:58,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:38:58,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-20 10:38:58,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-20 10:38:58,641 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,655 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,671 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:58,688 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-20 10:38:59,100 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-20 10:38:59,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,143 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-20 10:38:59,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,302 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-20 10:38:59,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:38:59,509 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-20 10:38:59,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,641 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-20 10:38:59,642 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-20 10:38:59,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:59,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-20 10:39:00,086 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:39:00,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-20 10:39:00,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:00,241 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-20 10:39:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:00,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:00,263 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-20 10:39:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:00,521 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-20 10:39:00,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:00,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:00,523 INFO L225 Difference]: With dead ends: 62 [2019-01-20 10:39:00,523 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:39:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:39:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-20 10:39:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:39:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-20 10:39:00,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-20 10:39:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:00,536 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-20 10:39:00,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-20 10:39:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:00,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:00,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:00,537 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-20 10:39:00,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:00,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:00,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:00,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:39:00,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:39:00,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:00,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:00,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:00,598 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-20 10:39:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:00,665 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-20 10:39:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:39:00,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:39:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:00,666 INFO L225 Difference]: With dead ends: 51 [2019-01-20 10:39:00,666 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 10:39:00,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 10:39:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-20 10:39:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:39:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-20 10:39:00,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-20 10:39:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:00,681 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-20 10:39:00,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-20 10:39:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:00,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:00,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:00,682 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:00,683 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-20 10:39:00,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:00,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:00,917 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-20 10:39:00,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-20 10:39:00,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:00,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:00,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:00,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:00,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:00,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:39:00,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:00,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:00,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:00,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:00,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:00,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:00,998 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 18 treesize of output 24 [2019-01-20 10:39:01,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,003 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 20 treesize of output 34 [2019-01-20 10:39:01,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,026 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 22 treesize of output 45 [2019-01-20 10:39:01,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:01,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:01,154 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,164 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,174 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:01,197 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:01,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,245 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-20 10:39:01,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:01,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,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, 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-20 10:39:01,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:01,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,325 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:01,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, 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-20 10:39:01,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:01,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:01,373 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-20 10:39:01,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:01,405 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-20 10:39:01,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:01,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:01,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:01,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:01,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:01,426 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-20 10:39:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:02,212 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-20 10:39:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:02,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:02,213 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:39:02,213 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:39:02,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:39:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-20 10:39:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:39:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-20 10:39:02,232 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-20 10:39:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:02,232 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-20 10:39:02,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:02,232 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-20 10:39:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:02,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:02,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:02,233 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-20 10:39:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:02,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:02,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:02,304 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-20 10:39:02,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:02,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:02,305 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-20 10:39:02,305 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:02,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:02,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:02,571 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:02,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:02,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,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 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-20 10:39:02,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:02,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:02,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:02,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:02,608 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 18 treesize of output 24 [2019-01-20 10:39:02,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,614 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 20 treesize of output 34 [2019-01-20 10:39:02,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,627 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 22 treesize of output 45 [2019-01-20 10:39:02,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:02,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:02,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:02,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,776 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:02,803 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:02,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,824 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-20 10:39:02,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:02,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:02,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:02,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:02,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:02,971 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-20 10:39:02,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:03,049 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-20 10:39:03,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:03,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:03,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:03,070 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-20 10:39:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:03,244 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-20 10:39:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:03,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:03,245 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:39:03,246 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:39:03,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:39:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-20 10:39:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 10:39:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-20 10:39:03,269 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-20 10:39:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:03,269 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-20 10:39:03,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-20 10:39:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:03,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:03,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:03,270 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-20 10:39:03,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:03,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:03,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:03,317 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-20 10:39:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:03,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:03,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:03,318 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-20 10:39:03,319 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:03,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:03,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:03,565 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:03,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:03,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:03,565 INFO 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-20 10:39:03,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:03,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:03,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:03,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:03,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:03,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:03,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:03,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:03,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:03,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:03,739 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,753 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,771 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:03,936 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:04,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,027 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-20 10:39:04,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:04,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,071 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:04,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 53 [2019-01-20 10:39:04,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:39:04,108 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-20 10:39:04,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:04,129 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-20 10:39:04,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:04,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:39:04,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:04,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:39:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:39:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:04,150 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-20 10:39:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:04,384 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-20 10:39:04,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:04,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-20 10:39:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:04,387 INFO L225 Difference]: With dead ends: 63 [2019-01-20 10:39:04,387 INFO L226 Difference]: Without dead ends: 62 [2019-01-20 10:39:04,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-20 10:39:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-20 10:39:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-20 10:39:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 10:39:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-20 10:39:04,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-20 10:39:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:04,406 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-20 10:39:04,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:39:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-20 10:39:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:04,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:04,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:04,408 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:04,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-20 10:39:04,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:04,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:04,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:04,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:04,466 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-20 10:39:04,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:04,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:04,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:04,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:04,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:04,467 INFO 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-20 10:39:04,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:04,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:04,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:39:04,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:04,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:04,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:04,507 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 18 treesize of output 24 [2019-01-20 10:39:04,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:04,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,517 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 22 treesize of output 45 [2019-01-20 10:39:04,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:04,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:04,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:04,637 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,655 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,674 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:04,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,694 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-20 10:39:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:04,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,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, 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-20 10:39:04,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:04,768 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-20 10:39:04,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:04,788 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-20 10:39:04,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:04,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:04,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:04,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:04,809 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-20 10:39:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:05,015 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-20 10:39:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:05,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:05,017 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:39:05,017 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:39:05,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-20 10:39:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:39:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-20 10:39:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:39:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-20 10:39:05,038 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-20 10:39:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:05,038 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-20 10:39:05,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-20 10:39:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:05,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:05,039 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 10:39:05,039 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-20 10:39:05,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:05,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:05,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:05,125 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-20 10:39:05,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:05,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:05,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:05,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:05,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:05,126 INFO 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-20 10:39:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:05,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:05,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:05,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:05,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:05,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:05,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:05,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:05,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:05,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:05,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:05,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:05,268 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,282 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:05,334 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:05,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:39:05,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:05,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:05,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,405 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-20 10:39:05,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,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-20 10:39:05,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-20 10:39:05,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,452 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-20 10:39:05,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:05,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:05,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,500 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-20 10:39:05,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:05,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:05,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:05,586 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-20 10:39:05,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:05,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-20 10:39:05,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:05,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:05,609 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-20 10:39:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:06,058 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-20 10:39:06,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:06,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:06,060 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:39:06,060 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:39:06,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:39:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-20 10:39:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:39:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-20 10:39:06,086 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-20 10:39:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:06,086 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-20 10:39:06,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-20 10:39:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:06,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:06,087 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:39:06,087 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-20 10:39:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:06,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:06,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:06,215 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-20 10:39:06,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:06,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:06,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:06,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:06,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:06,216 INFO 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-20 10:39:06,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:06,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:06,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:06,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:06,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:06,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:06,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:06,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:06,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:06,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:06,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:06,395 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,410 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,420 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:06,446 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:06,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:39:06,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,489 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-20 10:39:06,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:06,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:06,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:06,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-20 10:39:06,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,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 33 treesize of output 59 [2019-01-20 10:39:06,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:06,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:06,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-20 10:39:06,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:06,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-20 10:39:06,758 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-20 10:39:06,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:06,842 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-20 10:39:06,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:39:06,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:39:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:39:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:06,862 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-20 10:39:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:07,404 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-20 10:39:07,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:07,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:39:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:07,406 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:39:07,406 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:39:07,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:39:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-20 10:39:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:39:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-20 10:39:07,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-20 10:39:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:07,435 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-20 10:39:07,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:39:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-20 10:39:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:07,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:07,435 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:39:07,436 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-20 10:39:07,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:07,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:07,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:07,584 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-20 10:39:07,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:07,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:07,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:07,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:07,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39: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 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-20 10:39:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:07,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:07,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:07,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:07,626 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 18 treesize of output 24 [2019-01-20 10:39:07,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,632 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 20 treesize of output 34 [2019-01-20 10:39:07,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:07,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:07,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:07,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:07,784 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,794 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:07,822 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:07,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,848 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-20 10:39:07,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,866 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-20 10:39:07,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:07,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,893 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-20 10:39:07,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,915 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-20 10:39:07,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:07,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:07,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:07,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:07,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-20 10:39:08,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:08,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-20 10:39:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:08,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:08,143 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-20 10:39:08,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:08,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:39:08,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:08,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:39:08,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:39:08,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:08,163 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-20 10:39:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:08,587 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-20 10:39:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:08,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:39:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:08,589 INFO L225 Difference]: With dead ends: 116 [2019-01-20 10:39:08,590 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:39:08,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:39:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-20 10:39:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:39:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-20 10:39:08,613 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-20 10:39:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:08,613 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-20 10:39:08,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:39:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-20 10:39:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:08,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:08,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:08,614 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-20 10:39:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:08,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:08,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:08,681 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-20 10:39:08,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:08,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:08,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:08,682 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-20 10:39:08,684 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:08,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:09,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:09,340 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:09,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:09,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:09,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:39:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:09,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:09,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:09,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:09,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:09,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,392 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 20 treesize of output 34 [2019-01-20 10:39:09,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:09,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:09,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:09,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:09,561 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,571 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:09,598 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:09,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:09,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:09,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:09,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,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 33 treesize of output 59 [2019-01-20 10:39:09,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:09,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:09,703 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-20 10:39:09,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:09,735 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-20 10:39:09,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:09,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:09,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:09,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:09,755 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-20 10:39:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:10,069 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-20 10:39:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:10,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:10,071 INFO L225 Difference]: With dead ends: 72 [2019-01-20 10:39:10,071 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:39:10,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:39:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-20 10:39:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:39:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-20 10:39:10,095 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-20 10:39:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:10,095 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-20 10:39:10,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-20 10:39:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:10,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:10,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:10,096 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-20 10:39:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:10,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:10,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:10,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:10,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:10,186 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-20 10:39:10,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:10,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:10,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:10,187 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-20 10:39:10,188 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:10,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:10,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:10,820 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:10,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:10,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:10,820 INFO 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-20 10:39:10,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:10,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:10,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:10,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,875 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 20 treesize of output 34 [2019-01-20 10:39:10,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,890 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 22 treesize of output 45 [2019-01-20 10:39:10,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:10,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:11,025 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,034 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:11,062 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:11,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,087 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-20 10:39:11,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,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-20 10:39:11,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,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, 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-20 10:39:11,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:11,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:11,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:11,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,178 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-20 10:39:11,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:11,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:11,225 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-20 10:39:11,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:11,248 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-20 10:39:11,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:11,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:11,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:11,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:11,268 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-20 10:39:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:11,631 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-20 10:39:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:11,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:11,633 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:39:11,633 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:39:11,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:39:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-20 10:39:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:39:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-20 10:39:11,664 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-20 10:39:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:11,664 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-20 10:39:11,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-20 10:39:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:11,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:11,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:11,665 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-20 10:39:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:11,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:11,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:11,736 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-20 10:39:11,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:11,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:11,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:11,737 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-20 10:39:11,738 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:11,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:12,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:12,342 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:12,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:12,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:12,343 INFO 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-20 10:39:12,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:12,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:12,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:12,386 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 18 treesize of output 24 [2019-01-20 10:39:12,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,392 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 20 treesize of output 34 [2019-01-20 10:39:12,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:12,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:12,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:12,588 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,606 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,645 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:12,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,678 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-20 10:39:12,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,705 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-20 10:39:12,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:12,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,756 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-20 10:39:12,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,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-20 10:39:12,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:12,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,898 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:12,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:12,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:12,939 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-20 10:39:12,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:12,977 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-20 10:39:12,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:12,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:12,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:12,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:12,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:12,997 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-20 10:39:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:13,331 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-20 10:39:13,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:13,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:13,333 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:39:13,334 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:39:13,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:39:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-20 10:39:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:39:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-20 10:39:13,368 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-20 10:39:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:13,369 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-20 10:39:13,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-20 10:39:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:13,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:13,369 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:39:13,370 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-20 10:39:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:13,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:13,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:13,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:13,430 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-20 10:39:13,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:13,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:13,430 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:13,431 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-20 10:39:13,431 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:13,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:14,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:14,043 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:14,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:14,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:14,043 INFO 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-20 10:39:14,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:14,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:14,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:14,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:14,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:14,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:14,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:14,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:14,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:14,203 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 22 treesize of output 45 [2019-01-20 10:39:14,204 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,218 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:14,253 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,278 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-20 10:39:14,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,295 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-20 10:39:14,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:14,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:14,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:14,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:14,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,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, 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-20 10:39:14,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,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-20 10:39:14,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:14,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,432 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:14,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:39:14,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:14,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:14,474 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-20 10:39:14,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:14,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:14,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:39:14,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:14,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:39:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:39:14,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:14,545 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-20 10:39:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:15,004 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-20 10:39:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:15,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:39:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:15,006 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:39:15,006 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:39:15,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:39:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-20 10:39:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:39:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-20 10:39:15,036 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-20 10:39:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:15,036 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-20 10:39:15,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:39:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-20 10:39:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:15,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:15,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:15,037 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-20 10:39:15,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:15,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:15,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:15,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:15,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:15,148 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-20 10:39:15,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:15,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:15,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:15,149 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-20 10:39:15,150 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:15,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:15,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:15,348 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:15,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:15,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:15,349 INFO 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-20 10:39:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:15,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:15,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:15,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:15,388 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 18 treesize of output 24 [2019-01-20 10:39:15,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:15,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:15,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:15,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:15,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:15,533 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,543 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,571 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:15,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,595 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-20 10:39:15,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:15,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,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, 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-20 10:39:15,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:15,677 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-20 10:39:15,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:15,694 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-20 10:39:15,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:15,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:39:15,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:15,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:15,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:15,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:15,713 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-20 10:39:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:16,491 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-20 10:39:16,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:16,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:39:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:16,493 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:39:16,493 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:39:16,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:39:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-20 10:39:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:39:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-20 10:39:16,534 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-20 10:39:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:16,534 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-20 10:39:16,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-20 10:39:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:16,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:16,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:16,535 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-20 10:39:16,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:16,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:16,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:17,037 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-20 10:39:17,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:17,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:17,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:17,037 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-20 10:39:17,038 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:17,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:17,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:17,393 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:17,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:17,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:17,393 INFO 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-20 10:39:17,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:17,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:17,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:17,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39: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 18 treesize of output 24 [2019-01-20 10:39:17,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,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 20 treesize of output 34 [2019-01-20 10:39:17,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:39:17,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-20 10:39:17,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-20 10:39:17,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:17,625 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-20 10:39:17,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,675 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-20 10:39:17,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,692 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-20 10:39:17,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:17,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:17,713 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 36 [2019-01-20 10:39:17,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:17,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-20 10:39:17,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:39:17,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:17,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-20 10:39:17,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-20 10:39:17,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:17,813 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-20 10:39:17,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:17,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:17,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:17,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:17,832 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-20 10:39:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:18,160 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-20 10:39:18,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:18,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:18,163 INFO L225 Difference]: With dead ends: 122 [2019-01-20 10:39:18,163 INFO L226 Difference]: Without dead ends: 121 [2019-01-20 10:39:18,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-20 10:39:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-20 10:39:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:39:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-20 10:39:18,212 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-20 10:39:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:18,212 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-20 10:39:18,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-20 10:39:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:18,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:18,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:18,213 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-20 10:39:18,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:18,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:18,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:18,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:18,402 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-20 10:39:18,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:18,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:18,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:18,402 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-20 10:39:18,403 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:18,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:18,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:18,884 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:18,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:18,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:18,884 INFO 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-20 10:39:18,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:18,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:18,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:18,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:18,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:18,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:18,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:18,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:18,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:18,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:19,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:39:19,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-20 10:39:19,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-20 10:39:19,011 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,044 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:19,061 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-20 10:39:19,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,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, 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-20 10:39:19,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,100 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-20 10:39:19,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:19,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,120 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:19,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-20 10:39:19,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,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-20 10:39:19,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:39:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:19,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:19,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:19,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:19,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:19,190 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-20 10:39:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:19,412 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-20 10:39:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:19,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:19,414 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:39:19,414 INFO L226 Difference]: Without dead ends: 108 [2019-01-20 10:39:19,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-20 10:39:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-20 10:39:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:39:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-20 10:39:19,470 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-20 10:39:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:19,470 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-20 10:39:19,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-20 10:39:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:19,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:19,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:19,471 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:19,472 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-20 10:39:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:19,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:19,624 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-20 10:39:19,640 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-20 10:39:19,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:19,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:19,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:19,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:19,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:19,641 INFO 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-20 10:39:19,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:19,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:19,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:19,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:19,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:19,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:19,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:19,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:19,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,743 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:19,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:19,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:19,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:19,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,790 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:19,827 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:19,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,847 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-20 10:39:19,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,866 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-20 10:39:19,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:19,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,893 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-20 10:39:19,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:19,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:19,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,937 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:19,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 71 [2019-01-20 10:39:19,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:19,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:19,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-20 10:39:19,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:20,008 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-20 10:39:20,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:20,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:39:20,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:20,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:20,028 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-20 10:39:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:20,385 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-20 10:39:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:20,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:39:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:20,387 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:39:20,388 INFO L226 Difference]: Without dead ends: 136 [2019-01-20 10:39:20,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-20 10:39:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-20 10:39:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:39:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-20 10:39:20,432 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-20 10:39:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:20,432 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-20 10:39:20,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-20 10:39:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:20,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:20,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:20,433 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-20 10:39:20,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:20,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:20,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:20,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:20,478 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-20 10:39:20,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:20,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:20,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:20,479 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-20 10:39:20,480 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:20,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:20,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:20,928 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:20,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:20,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:20,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:39:20,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:20,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:20,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:20,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-20 10:39:20,948 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 17 treesize of output 19 [2019-01-20 10:39:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-01-20 10:39:20,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:20,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:21,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:39:21,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-20 10:39:21,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:39:21,028 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,037 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,052 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,065 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-20 10:39:21,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:39:21,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:39:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,200 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-20 10:39:21,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,207 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-20 10:39:21,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-20 10:39:21,217 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-20 10:39:21,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:21,237 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-20 10:39:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:21,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:21,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:21,256 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-20 10:39:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:21,460 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-20 10:39:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:21,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:21,462 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:39:21,463 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:39:21,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-20 10:39:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:39:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-20 10:39:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-20 10:39:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-20 10:39:21,524 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-20 10:39:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:21,524 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-20 10:39:21,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-20 10:39:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:21,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:21,525 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:39:21,525 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:21,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-20 10:39:21,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:21,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:21,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:21,709 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-20 10:39:21,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:21,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:21,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:21,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:21,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:21,709 INFO 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-20 10:39:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:21,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:21,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:21,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:21,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:21,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:21,748 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 18 treesize of output 24 [2019-01-20 10:39:21,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,751 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 20 treesize of output 34 [2019-01-20 10:39:21,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:21,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:21,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:21,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:21,875 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,883 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,892 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,912 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:21,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:21,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,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-20 10:39:21,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:21,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:21,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:22,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,045 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:22,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:39:22,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:22,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:22,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,103 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-20 10:39:22,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,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-20 10:39:22,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:22,149 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-20 10:39:22,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:22,187 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-20 10:39:22,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:22,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:39:22,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:22,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:39:22,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:39:22,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:22,207 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-20 10:39:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:22,668 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-20 10:39:22,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:22,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:39:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:22,670 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:39:22,670 INFO L226 Difference]: Without dead ends: 116 [2019-01-20 10:39:22,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:22,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-20 10:39:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-20 10:39:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:39:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-20 10:39:22,714 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-20 10:39:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:22,714 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-20 10:39:22,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:39:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-20 10:39:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:22,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:22,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:22,715 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-20 10:39:22,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:22,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:22,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:22,820 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-20 10:39:22,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:22,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:22,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:22,821 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-20 10:39:22,821 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:22,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:23,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:23,517 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:39:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:23,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:23,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:23,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 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-20 10:39:23,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:23,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:23,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:23,559 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 18 treesize of output 24 [2019-01-20 10:39:23,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,576 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 20 treesize of output 34 [2019-01-20 10:39:23,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,592 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 22 treesize of output 45 [2019-01-20 10:39:23,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:23,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:23,748 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,759 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,787 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:23,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:23,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,835 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-20 10:39:23,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:23,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,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, 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-20 10:39:23,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,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-20 10:39:23,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:23,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,922 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:23,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,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 76 [2019-01-20 10:39:23,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:23,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:23,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,983 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:23,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, 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-20 10:39:23,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:24,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:39:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:24,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:24,100 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-20 10:39:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:39:24,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:24,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:39:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:39:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:24,120 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-20 10:39:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:24,641 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-20 10:39:24,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:24,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:39:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:24,643 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:39:24,643 INFO L226 Difference]: Without dead ends: 136 [2019-01-20 10:39:24,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:39:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-20 10:39:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-20 10:39:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:39:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-20 10:39:24,700 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-20 10:39:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:24,701 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-20 10:39:24,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:39:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-20 10:39:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:24,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:24,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:24,702 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-20 10:39:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:24,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:24,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:24,885 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-20 10:39:24,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:24,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:24,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:24,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:24,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:24,886 INFO 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-20 10:39:24,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:24,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:24,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:24,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:24,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:24,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:24,917 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 18 treesize of output 24 [2019-01-20 10:39:24,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,925 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 20 treesize of output 34 [2019-01-20 10:39:24,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,931 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 22 treesize of output 45 [2019-01-20 10:39:24,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:25,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:25,097 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,136 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,145 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,164 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:25,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,190 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-20 10:39:25,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,209 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-20 10:39:25,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:25,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,249 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:25,250 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-20 10:39:25,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,269 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-20 10:39:25,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-20 10:39:25,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,297 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-20 10:39:25,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:25,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-20 10:39:25,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,346 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:25,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,348 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-20 10:39:25,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,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-20 10:39:25,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-20 10:39:25,392 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-20 10:39:25,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:25,442 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-20 10:39:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:39:25,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:39:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:39:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:25,461 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-20 10:39:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:26,090 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-20 10:39:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:26,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:39:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:26,093 INFO L225 Difference]: With dead ends: 172 [2019-01-20 10:39:26,093 INFO L226 Difference]: Without dead ends: 167 [2019-01-20 10:39:26,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-20 10:39:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-20 10:39:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-20 10:39:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-20 10:39:26,172 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-20 10:39:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:26,173 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-20 10:39:26,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:39:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-20 10:39:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:26,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:26,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:26,174 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-20 10:39:26,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:26,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:26,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:26,505 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-01-20 10:39:26,589 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-20 10:39:26,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:26,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:26,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:26,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:26,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:26,590 INFO 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-20 10:39:26,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:26,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:26,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:26,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:26,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:26,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:26,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:26,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:26,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:26,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:26,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:26,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:26,720 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,770 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:26,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,798 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-20 10:39:26,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,817 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-20 10:39:26,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:26,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,843 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:26,844 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-20 10:39:26,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,863 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-20 10:39:26,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-20 10:39:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,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 31 treesize of output 65 [2019-01-20 10:39:26,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:26,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-20 10:39:26,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,938 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:26,938 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-20 10:39:26,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:26,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-20 10:39:26,984 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-20 10:39:26,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:27,042 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-20 10:39:27,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:27,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:39:27,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:27,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:39:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:39:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:27,061 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-20 10:39:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:27,510 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-20 10:39:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:27,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:39:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:27,513 INFO L225 Difference]: With dead ends: 140 [2019-01-20 10:39:27,513 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 10:39:27,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:39:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 10:39:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-20 10:39:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 10:39:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-20 10:39:27,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-20 10:39:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:27,569 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-20 10:39:27,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:39:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-20 10:39:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:27,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:27,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:27,570 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-20 10:39:27,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:27,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:27,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:27,741 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-20 10:39:27,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:27,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:27,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:27,742 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-20 10:39:27,743 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:27,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:28,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:28,338 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:28,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:28,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:28,338 INFO 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-20 10:39:28,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:28,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:28,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:28,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:28,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 18 treesize of output 24 [2019-01-20 10:39:28,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,390 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 20 treesize of output 34 [2019-01-20 10:39:28,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,399 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 22 treesize of output 45 [2019-01-20 10:39:28,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:28,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:28,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:28,521 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,531 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,559 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:28,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,585 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-20 10:39:28,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,603 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-20 10:39:28,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:28,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:28,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:28,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,682 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:28,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,683 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-20 10:39:28,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:28,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:28,731 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-20 10:39:28,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:28,766 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-20 10:39:28,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:28,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:28,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:28,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:28,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:28,786 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-20 10:39:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:29,246 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-20 10:39:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:29,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:39:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:29,247 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:39:29,247 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:39:29,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:39:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-20 10:39:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 10:39:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-20 10:39:29,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-20 10:39:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:29,311 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-20 10:39:29,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-20 10:39:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:29,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:29,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:29,311 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-20 10:39:29,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:29,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:29,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:29,432 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-20 10:39:29,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:29,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:29,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:29,433 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-20 10:39:29,436 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:29,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:30,413 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:30,413 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:39:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:30,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:30,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:30,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:39:30,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:30,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:30,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:30,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:30,474 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 18 treesize of output 24 [2019-01-20 10:39:30,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,482 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 20 treesize of output 34 [2019-01-20 10:39:30,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:30,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:30,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:30,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:30,621 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,631 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,658 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:30,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,682 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-20 10:39:30,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,701 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-20 10:39:30,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:30,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:30,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:30,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:30,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:30,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:30,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:30,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:30,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,835 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:30,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,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-20 10:39:30,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-20 10:39:30,881 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-20 10:39:30,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:30,924 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-20 10:39:30,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:30,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:39:30,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:30,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:39:30,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:39:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:30,944 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-20 10:39:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:31,483 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-20 10:39:31,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:31,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:39:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:31,484 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:39:31,484 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:39:31,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:39:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:39:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-20 10:39:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 10:39:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-20 10:39:31,569 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-20 10:39:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:31,570 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-20 10:39:31,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:39:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-20 10:39:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:31,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:31,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:31,571 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-20 10:39:31,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:31,884 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-20 10:39:31,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:31,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:31,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:31,885 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-20 10:39:31,886 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:31,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:32,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:32,565 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:32,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:32,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:32,566 INFO 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-20 10:39:32,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:32,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:32,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:32,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:32,631 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 18 treesize of output 20 [2019-01-20 10:39:32,639 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 20 treesize of output 22 [2019-01-20 10:39:32,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-20 10:39:32,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:32,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-20 10:39:32,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,713 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:39:32,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:32,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-20 10:39:32,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-20 10:39:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-20 10:39:32,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-01-20 10:39:32,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:32,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-20 10:39:32,803 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-20 10:39:32,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:32,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:39:32,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-20 10:39:32,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:32,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:39:32,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:39:32,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:32,854 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-20 10:39:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:33,070 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-20 10:39:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:33,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-20 10:39:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:33,071 INFO L225 Difference]: With dead ends: 115 [2019-01-20 10:39:33,071 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:39:33,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:39:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-20 10:39:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:39:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-20 10:39:33,178 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-20 10:39:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:33,178 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-20 10:39:33,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:39:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-20 10:39:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:33,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:33,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:33,179 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:33,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-20 10:39:33,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:33,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:33,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:33,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:33,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:33,587 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-20 10:39:33,753 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:39:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:33,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:33,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:33,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:33,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:33,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:33,783 INFO 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-20 10:39:33,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:33,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:33,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:33,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:33,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:33,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:33,820 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 18 treesize of output 24 [2019-01-20 10:39:33,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:33,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,831 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 22 treesize of output 45 [2019-01-20 10:39:33,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:33,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:33,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:33,952 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,962 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,971 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,990 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:34,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:39:34,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,110 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-20 10:39:34,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,136 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:34,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, 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-20 10:39:34,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,158 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-20 10:39:34,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-20 10:39:34,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:39:34,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:34,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:39:34,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,237 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:34,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, 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-20 10:39:34,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:34,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:39:34,292 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-20 10:39:34,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:34,337 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-20 10:39:34,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:34,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:39:34,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:34,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:39:34,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:39:34,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:34,357 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-20 10:39:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:34,978 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-20 10:39:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:34,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:39:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:34,980 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:39:34,981 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:39:34,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:39:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-20 10:39:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:39:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-20 10:39:35,075 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-20 10:39:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:35,075 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-20 10:39:35,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:39:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-20 10:39:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:35,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:35,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:35,076 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-20 10:39:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:35,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:35,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:35,144 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-20 10:39:35,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:35,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:35,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:35,145 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-20 10:39:35,149 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:35,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:35,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:35,705 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:35,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:35,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:35,706 INFO 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-20 10:39:35,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:35,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:35,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:35,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:35,735 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 18 treesize of output 20 [2019-01-20 10:39:35,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-20 10:39:35,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-20 10:39:35,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:35,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:35,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:35,864 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,872 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:35,899 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-20 10:39:35,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:39:35,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,939 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-20 10:39:35,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:35,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:39:35,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,975 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-20 10:39:35,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-20 10:39:35,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,994 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:35,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 55 [2019-01-20 10:39:35,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:36,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-20 10:39:36,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-20 10:39:36,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:36,065 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-20 10:39:36,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:36,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:36,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:36,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:36,085 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-20 10:39:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:36,488 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-20 10:39:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:36,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:39:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:36,489 INFO L225 Difference]: With dead ends: 68 [2019-01-20 10:39:36,490 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:39:36,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 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-20 10:39:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:39:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-20 10:39:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 10:39:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-20 10:39:36,584 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-20 10:39:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:36,584 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-20 10:39:36,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-20 10:39:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:36,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:36,585 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:39:36,585 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-20 10:39:36,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:36,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:36,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:36,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:36,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:36,647 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-20 10:39:36,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:39:36,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:39:36,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:36,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:36,648 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-20 10:39:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:36,758 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-20 10:39:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:36,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-20 10:39:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:36,759 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:39:36,760 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 10:39:36,760 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-20 10:39:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 10:39:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-20 10:39:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 10:39:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-20 10:39:36,846 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-20 10:39:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:36,847 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-20 10:39:36,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-20 10:39:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:36,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:36,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:36,847 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-20 10:39:36,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:36,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:36,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:36,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:36,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:36,991 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:39:37,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-20 10:39:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:37,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:37,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:37,072 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-20 10:39:37,073 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:37,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:37,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:37,658 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:37,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:37,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:37,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 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-20 10:39:37,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:37,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:37,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:37,810 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-20 10:39:37,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:37,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:38,188 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:39:38,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:38,649 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-20 10:39:38,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,762 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-20 10:39:38,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:38,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:39,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:39,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:39,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:39,325 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,344 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,353 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:39,378 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:39,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,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, 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-20 10:39:39,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:39,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:39,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,453 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:39,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, 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-20 10:39:39,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:39,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:39:39,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,499 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-20 10:39:39,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:39,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-20 10:39:39,539 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-20 10:39:39,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:39,562 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-20 10:39:39,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:39,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:39,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:39,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:39,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:39,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:39,583 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-20 10:39:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:39,969 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-20 10:39:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:39,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:39:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:39,971 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:39:39,971 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:39:39,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:39:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-20 10:39:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:39:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-20 10:39:40,084 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-20 10:39:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:40,085 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-20 10:39:40,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-20 10:39:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:40,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:40,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:40,085 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-20 10:39:40,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:40,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:40,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:40,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:40,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:40,221 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-20 10:39:40,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:40,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:40,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:40,221 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-20 10:39:40,223 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:40,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:40,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:40,407 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:40,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:40,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:40,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 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-20 10:39:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:40,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:40,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:40,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:40,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:40,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:40,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:40,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:40,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:40,557 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 22 treesize of output 45 [2019-01-20 10:39:40,558 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,573 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,581 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:40,608 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:40,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:40,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:40,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:40,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,682 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-20 10:39:40,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:40,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:40,726 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-20 10:39:40,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:40,741 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-20 10:39:40,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:40,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:40,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:40,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:40,760 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-20 10:39:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:41,171 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-20 10:39:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:41,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:39:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:41,172 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:39:41,173 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:39:41,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:39:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-20 10:39:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 10:39:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-20 10:39:41,276 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-20 10:39:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:41,276 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-20 10:39:41,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-20 10:39:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:41,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:41,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:41,277 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-20 10:39:41,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:41,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:41,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:41,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:41,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:41,361 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-20 10:39:41,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:41,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:41,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:41,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:41,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:41,361 INFO 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-20 10:39:41,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:41,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:41,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:41,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:41,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:41,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:41,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:41,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:41,426 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:41,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:39:41,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-20 10:39:41,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-20 10:39:41,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,547 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-20 10:39:41,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-20 10:39:41,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,589 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-20 10:39:41,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:41,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,610 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-20 10:39:41,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,624 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-20 10:39:41,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-20 10:39:41,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,649 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:41,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 55 [2019-01-20 10:39:41,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-20 10:39:41,682 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-20 10:39:41,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:41,719 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-20 10:39:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:41,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:41,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:41,739 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-20 10:39:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:42,194 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-20 10:39:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:42,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:39:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:42,195 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:39:42,195 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:39:42,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:39:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-20 10:39:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:39:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-20 10:39:42,314 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-20 10:39:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:42,314 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-20 10:39:42,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-20 10:39:42,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:39:42,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:42,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:42,315 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:42,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-20 10:39:42,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:42,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:42,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:42,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:42,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:42,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:42,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:42,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:39:42,433 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-20 10:39:42,435 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:42,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:42,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:42,657 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:42,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:42,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:42,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 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-20 10:39:42,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:42,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:42,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:42,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 14 treesize of output 17 [2019-01-20 10:39:42,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 17 treesize of output 19 [2019-01-20 10:39:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-01-20 10:39:42,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:42,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-20 10:39:42,752 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 20 treesize of output 22 [2019-01-20 10:39:42,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:39:42,756 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,768 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,776 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:42,797 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-20 10:39:42,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:39:42,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:42,866 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 2 xjuncts. [2019-01-20 10:39:42,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-20 10:39:42,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,893 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:42,894 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-20 10:39:42,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-20 10:39:42,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:42,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:42,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-20 10:39:42,971 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-20 10:39:42,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:43,002 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-20 10:39:43,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:43,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-20 10:39:43,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:43,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:43,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:43,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:43,023 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-20 10:39:43,554 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-20 10:39:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:44,062 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-20 10:39:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:44,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:39:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:44,064 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:39:44,064 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:39:44,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:39:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:39:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-20 10:39:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 10:39:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-20 10:39:44,257 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-20 10:39:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:44,257 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-20 10:39:44,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-20 10:39:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:39:44,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:44,257 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:44,258 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:44,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-20 10:39:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:44,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:44,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:44,420 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-20 10:39:44,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:44,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:44,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:39:44,421 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-20 10:39:44,423 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:44,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:44,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:44,877 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:44,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:44,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:44,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 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-20 10:39:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:44,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:44,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:44,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 18 treesize of output 24 [2019-01-20 10:39:44,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:44,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:44,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:44,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:44,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:44,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:45,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:45,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:45,070 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,079 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:45,106 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:45,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,128 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-20 10:39:45,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:45,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:45,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,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, 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-20 10:39:45,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:45,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:45,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:45,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-20 10:39:45,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:45,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:45,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:45,266 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-20 10:39:45,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:45,297 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-20 10:39:45,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:45,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:39:45,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:45,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:39:45,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:39:45,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:45,317 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-20 10:39:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:45,952 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-20 10:39:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:39:45,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:39:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:45,954 INFO L225 Difference]: With dead ends: 118 [2019-01-20 10:39:45,954 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:39:45,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:39:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-20 10:39:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-20 10:39:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-20 10:39:46,175 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-20 10:39:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:46,175 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-20 10:39:46,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:39:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-20 10:39:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:39:46,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:46,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:46,176 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-20 10:39:46,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:46,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:46,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:46,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:46,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:46,280 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-20 10:39:46,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:46,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:46,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:39:46,281 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-20 10:39:46,281 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:46,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:46,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:46,961 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:39:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:46,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:46,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:46,961 INFO 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-20 10:39:46,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:46,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:46,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:47,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:47,009 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 18 treesize of output 24 [2019-01-20 10:39:47,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:47,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,026 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 22 treesize of output 45 [2019-01-20 10:39:47,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:47,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:47,151 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,188 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:47,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,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, 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-20 10:39:47,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,236 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-20 10:39:47,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:47,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:39:47,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,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-20 10:39:47,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:47,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,314 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:47,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:47,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:47,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,423 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:47,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:47,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-20 10:39:47,470 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-20 10:39:47,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:47,524 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-20 10:39:47,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:47,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:39:47,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:47,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:39:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:39:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:47,543 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-20 10:39:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:48,409 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-20 10:39:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:39:48,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-20 10:39:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:48,411 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:39:48,411 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:39:48,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:39:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:39:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-20 10:39:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:39:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-20 10:39:48,692 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-20 10:39:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:48,692 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-20 10:39:48,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:39:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-20 10:39:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:39:48,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:48,693 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:48,693 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-20 10:39:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:48,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:48,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:48,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:48,785 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-20 10:39:48,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:48,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:48,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:39:48,785 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-20 10:39:48,787 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:48,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:48,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:48,977 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:48,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:48,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:48,977 INFO 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-20 10:39:48,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:48,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:48,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:48,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:48,998 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 18 treesize of output 20 [2019-01-20 10:39:49,007 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 20 treesize of output 22 [2019-01-20 10:39:49,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-20 10:39:49,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-20 10:39:49,086 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 17 treesize of output 19 [2019-01-20 10:39:49,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 9 [2019-01-20 10:39:49,099 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,105 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:49,124 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-20 10:39:49,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:39:49,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:49,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-20 10:39:49,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-20 10:39:49,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:39:49,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-20 10:39:49,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:49,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-20 10:39:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-20 10:39:49,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-20 10:39:49,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:49,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-20 10:39:49,373 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-20 10:39:49,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:49,408 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-20 10:39:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:39:49,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:49,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:49,427 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-20 10:39:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:50,149 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-20 10:39:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:50,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:39:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:50,151 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:39:50,151 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:39:50,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:39:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-20 10:39:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:39:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-20 10:39:50,467 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-20 10:39:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:50,467 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-20 10:39:50,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-20 10:39:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:39:50,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:50,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:50,468 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:50,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:50,468 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-20 10:39:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:50,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:50,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:50,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:50,648 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:39:50,735 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-20 10:39:50,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:50,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:50,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:50,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:50,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:50,736 INFO 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-20 10:39:50,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:50,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:50,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:50,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:50,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:50,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 15 treesize of output 18 [2019-01-20 10:39:50,760 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 18 treesize of output 20 [2019-01-20 10:39:50,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-20 10:39:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-20 10:39:50,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:50,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:50,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:50,879 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,914 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-20 10:39:50,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:39:50,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:51,007 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 2 xjuncts. [2019-01-20 10:39:51,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-20 10:39:51,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:39:51,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:51,122 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 30 treesize of output 34 [2019-01-20 10:39:51,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:51,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-20 10:39:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,203 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:51,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 37 treesize of output 77 [2019-01-20 10:39:51,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-01-20 10:39:51,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:51,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-20 10:39:51,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-20 10:39:51,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,360 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:51,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-20 10:39:51,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:51,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-20 10:39:51,433 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-20 10:39:51,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:51,482 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-20 10:39:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:39:51,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:51,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:39:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:39:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:51,502 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-20 10:39:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:52,886 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-20 10:39:52,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:39:52,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-20 10:39:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:52,888 INFO L225 Difference]: With dead ends: 186 [2019-01-20 10:39:52,888 INFO L226 Difference]: Without dead ends: 177 [2019-01-20 10:39:52,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:39:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-20 10:39:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-20 10:39:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:39:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-20 10:39:53,312 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-20 10:39:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:53,312 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-20 10:39:53,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:39:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-20 10:39:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:39:53,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:53,313 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:53,313 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-20 10:39:53,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:53,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:53,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:53,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:53,549 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-20 10:39:53,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:53,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:53,550 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:39:53,550 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-20 10:39:53,551 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:53,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:54,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:54,112 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:54,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:54,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:54,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:39:54,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:54,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:54,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:54,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:54,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:54,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:54,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:54,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:54,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:54,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:54,270 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,286 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:54,320 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:54,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,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 45 [2019-01-20 10:39:54,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,362 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-20 10:39:54,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:54,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,387 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-20 10:39:54,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:54,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:54,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,438 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:54,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-20 10:39:54,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,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-20 10:39:54,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:54,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,497 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 89 [2019-01-20 10:39:54,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:54,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-20 10:39:54,547 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-20 10:39:54,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:54,590 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-20 10:39:54,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:54,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:39:54,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:54,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:39:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:39:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:54,610 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-20 10:39:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:55,405 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-20 10:39:55,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:55,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:39:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:55,410 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:39:55,410 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:39:55,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:39:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:39:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-20 10:39:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:39:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-20 10:39:55,514 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-20 10:39:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:55,514 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-20 10:39:55,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:39:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-20 10:39:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:39:55,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:55,514 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:39:55,515 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:55,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-20 10:39:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:55,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:55,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-20 10:39:55,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:55,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:55,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:55,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:55,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:55,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:39:55,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:55,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:55,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:55,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:55,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:55,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:55,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:55,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:55,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-20 10:39:55,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-20 10:39:55,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-20 10:39:55,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-20 10:39:55,777 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,801 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,828 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-20 10:39:55,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,855 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-20 10:39:55,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,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-20 10:39:55,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:55,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,904 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-20 10:39:55,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,924 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-20 10:39:55,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:55,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,958 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:55,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-20 10:39:55,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,984 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-20 10:39:55,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:56,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:56,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,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, 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-20 10:39:56,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:56,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-20 10:39:56,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 59 [2019-01-20 10:39:56,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:56,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-20 10:39:56,115 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-20 10:39:56,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:56,192 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-20 10:39:56,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:56,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:39:56,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:56,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:39:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:39:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:56,212 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-20 10:39:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:56,697 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-20 10:39:56,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:56,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-20 10:39:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:56,699 INFO L225 Difference]: With dead ends: 32 [2019-01-20 10:39:56,699 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:39:56,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:39:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:39:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:39:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:39:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:39:56,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-20 10:39:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:56,701 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:39:56,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:39:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:39:56,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:39:56,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:39:56,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:56,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:56,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:57,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:58,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:39:58,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:40:00,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:40:01,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:40:01,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:40:05,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:40:07,309 WARN L181 SmtUtils]: Spent 10.60 s on a formula simplification. DAG size of input: 1504 DAG size of output: 1059 [2019-01-20 10:40:23,892 WARN L181 SmtUtils]: Spent 16.57 s on a formula simplification. DAG size of input: 996 DAG size of output: 75 [2019-01-20 10:40:23,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:40:23,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-20 10:40:23,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-20 10:40:23,894 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-20 10:40:23,894 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-20 10:40:23,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-20 10:40:23,895 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse16 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse15 (select .cse16 ULTIMATE.start_main_p1)) (.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1)))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse17 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse9 (= 0 .cse15)) (.cse5 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse18 (= 0 (select .cse16 ULTIMATE.start_main_p2))) (.cse7 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (let ((.cse13 (and .cse0 .cse17 .cse4 .cse9 .cse5 .cse18 (<= 1 (select .cse7 ULTIMATE.start_main_p3)))) (.cse12 (select .cse10 ULTIMATE.start_main_p3)) (.cse14 (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) .cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse5 (<= 0 .cse6)) (and .cse4 (let ((.cse8 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (= 0 (select .cse7 ULTIMATE.start_main_p2)) (<= 1 (select .cse7 ULTIMATE.start_main_p1))) (and .cse8 (and .cse9 .cse0)) (and (<= 1 (select .cse10 ULTIMATE.start_main_p1)) .cse8))) (<= .cse1 0) (<= 0 .cse12)) (and .cse13 .cse14) (and .cse13 (= .cse15 (select .cse16 ULTIMATE.start_main_p4))) (and (and .cse17 .cse9 (= 0 .cse12) .cse18) .cse14))))))) [2019-01-20 10:40:23,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:40:23,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-20 10:40:23,895 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-20 10:40:23,895 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-20 10:40:23,909 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:40:23 BoogieIcfgContainer [2019-01-20 10:40:23,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:40:23,910 INFO L168 Benchmark]: Toolchain (without parser) took 114638.99 ms. Allocated memory was 131.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 106.3 MB in the beginning and 465.2 MB in the end (delta: -358.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-01-20 10:40:23,910 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 131.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:40:23,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.29 ms. Allocated memory is still 131.1 MB. Free memory was 106.1 MB in the beginning and 104.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:40:23,911 INFO L168 Benchmark]: Boogie Preprocessor took 23.32 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:40:23,912 INFO L168 Benchmark]: RCFGBuilder took 378.41 ms. Allocated memory is still 131.1 MB. Free memory was 102.7 MB in the beginning and 92.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-01-20 10:40:23,912 INFO L168 Benchmark]: TraceAbstraction took 114175.88 ms. Allocated memory was 131.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 92.1 MB in the beginning and 465.2 MB in the end (delta: -373.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-01-20 10:40:23,914 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.20 ms. Allocated memory is still 131.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.29 ms. Allocated memory is still 131.1 MB. Free memory was 106.1 MB in the beginning and 104.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.32 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 102.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 378.41 ms. Allocated memory is still 131.1 MB. Free memory was 102.7 MB in the beginning and 92.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114175.88 ms. Allocated memory was 131.1 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 92.1 MB in the beginning and 465.2 MB in the end (delta: -373.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || (((!(p3 == p4) && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && !(p1 == p4))) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0))) && #memory_int[p4] <= 0) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p3])) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p3 := #memory_int[p3] + 1][p1] == #memory_int[p3 := #memory_int[p3] + 1][p4])) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 114.0s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 27.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 22.1s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 352 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4079744448 FormulaSimplificationTreeSizeReduction, 10.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39947544 FormulaSimplificationTreeSizeReductionInter, 16.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 35.5s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91459 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...