java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:13:29,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:13:29,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:13:29,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:13:29,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:13:29,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:13:29,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:13:29,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:13:29,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:13:29,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:13:29,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:13:29,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:13:29,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:13:29,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:13:29,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:13:29,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:13:29,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:13:29,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:13:29,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:13:29,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:13:29,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:13:29,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:13:29,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:13:29,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:13:29,115 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:13:29,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:13:29,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:13:29,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:13:29,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:13:29,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:13:29,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:13:29,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:13:29,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:13:29,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:13:29,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:13:29,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:13:29,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:13:29,134 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:13:29,134 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:13:29,135 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:13:29,135 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:13:29,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:13:29,135 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:13:29,135 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:13:29,136 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:13:29,136 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:13:29,136 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:13:29,136 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:13:29,136 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:13:29,136 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:13:29,137 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:13:29,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:13:29,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:13:29,138 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:13:29,138 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:13:29,138 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:13:29,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:13:29,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:13:29,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:13:29,139 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:13:29,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:13:29,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:13:29,139 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:13:29,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:13:29,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:13:29,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:13:29,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:13:29,140 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:13:29,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:13:29,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:13:29,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:13:29,141 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:13:29,141 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:13:29,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:13:29,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:13:29,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:13:29,142 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:13:29,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:13:29,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:13:29,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:13:29,190 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:13:29,190 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:13:29,191 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-01-11 11:13:29,191 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-01-11 11:13:29,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:13:29,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:13:29,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:13:29,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:13:29,229 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:13:29,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:13:29,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:13:29,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:13:29,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:13:29,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/1) ... [2019-01-11 11:13:29,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:13:29,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:13:29,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:13:29,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:13:29,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13: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:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:13:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:13:29,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:13:29,834 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:13:29,834 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-11 11:13:29,835 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:13:29 BoogieIcfgContainer [2019-01-11 11:13:29,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:13:29,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:13:29,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:13:29,840 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:13:29,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:29" (1/2) ... [2019-01-11 11:13:29,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ef014 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:13:29, skipping insertion in model container [2019-01-11 11:13:29,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:13:29" (2/2) ... [2019-01-11 11:13:29,843 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-01-11 11:13:29,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:13:29,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-11 11:13:29,894 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-11 11:13:29,928 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:13:29,929 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:13:29,929 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:13:29,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:13:29,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:13:29,929 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:13:29,930 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:13:29,930 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:13:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-11 11:13:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:13:29,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:29,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:13:29,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-11 11:13:29,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:29,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:29,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:29,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:30,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:13:30,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:30,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:13:30,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:13:30,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:30,147 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-11 11:13:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:30,390 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-11 11:13:30,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:30,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:13:30,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:30,407 INFO L225 Difference]: With dead ends: 29 [2019-01-11 11:13:30,408 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:13:30,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:13:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-11 11:13:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 11:13:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-11 11:13:30,442 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-11 11:13:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:30,444 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-11 11:13:30,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:13:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-11 11:13:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:30,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:30,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:30,445 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-11 11:13:30,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:30,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:30,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:30,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:30,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:30,619 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:30,622 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-11 11:13:30,653 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:30,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:30,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:30,742 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:30,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:30,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:30,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:30,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:30,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:31,204 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-11 11:13:31,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:31,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:31,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,300 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 24 treesize of output 30 [2019-01-11 11:13:31,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,318 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 26 treesize of output 40 [2019-01-11 11:13:31,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:31,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,496 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-11 11:13:31,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:31,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,635 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-11 11:13:31,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:31,639 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,814 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,876 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,914 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:32,016 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:32,183 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-11 11:13:32,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,380 INFO L303 Elim1Store]: Index analysis took 181 ms [2019-01-11 11:13:32,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:32,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:32,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:32,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:32,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:32,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:32,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:32,650 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-11 11:13:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:34,423 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-11 11:13:34,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:34,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:34,426 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:13:34,426 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:13:34,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:13:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-11 11:13:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:13:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-11 11:13:34,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-11 11:13:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:34,434 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-11 11:13:34,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-11 11:13:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:34,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:34,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:34,435 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-11 11:13:34,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:34,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:34,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:34,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:34,616 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-11 11:13:34,618 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:34,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:34,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:34,630 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:34,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:34,777 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-11 11:13:34,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:34,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,790 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 24 treesize of output 30 [2019-01-11 11:13:34,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,812 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 26 treesize of output 40 [2019-01-11 11:13:34,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:34,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:34,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,058 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:35,171 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,198 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 1 xjuncts. [2019-01-11 11:13:35,199 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:35,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:35,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:35,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:35,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:35,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:13:35,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:35,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:35,437 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-11 11:13:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:35,531 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-11 11:13:35,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:13:35,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:13:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:35,533 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:13:35,533 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 11:13:35,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 11:13:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-11 11:13:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:13:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-11 11:13:35,539 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-11 11:13:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:35,539 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-11 11:13:35,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-11 11:13:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:35,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:35,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:35,541 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-11 11:13:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:35,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:35,627 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:35,628 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-11 11:13:35,630 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:35,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:35,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:35,640 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:35,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:35,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:35,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:35,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:35,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:35,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,747 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 24 treesize of output 30 [2019-01-11 11:13:35,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,814 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 26 treesize of output 40 [2019-01-11 11:13:35,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:35,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:35,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,973 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-11 11:13:35,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:35,976 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,023 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,155 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:36,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:36,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:36,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:36,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:36,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:36,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:36,453 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-11 11:13:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:37,903 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-01-11 11:13:37,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:37,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:37,907 INFO L225 Difference]: With dead ends: 50 [2019-01-11 11:13:37,907 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 11:13:37,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 11:13:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-01-11 11:13:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:13:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-01-11 11:13:37,915 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-01-11 11:13:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:37,915 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-01-11 11:13:37,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-01-11 11:13:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:37,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:37,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:37,916 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-11 11:13:37,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:38,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:38,030 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-11 11:13:38,031 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:38,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:38,039 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:38,039 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:38,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:38,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:38,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,147 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 24 treesize of output 30 [2019-01-11 11:13:38,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:38,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:38,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:38,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:38,232 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:38,442 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:38,467 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:38,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:38,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:38,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:38,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:38,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:38,767 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-01-11 11:13:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:39,753 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-01-11 11:13:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:39,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:39,755 INFO L225 Difference]: With dead ends: 50 [2019-01-11 11:13:39,755 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:13:39,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:13:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-11 11:13:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:13:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-01-11 11:13:39,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-01-11 11:13:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:39,763 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-01-11 11:13:39,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-01-11 11:13:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:39,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:39,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:39,765 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:39,765 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-11 11:13:39,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:39,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:39,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:39,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:39,906 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:39,906 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-11 11:13:39,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:39,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:39,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:39,916 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:39,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:39,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:39,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:40,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:40,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,016 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 26 treesize of output 40 [2019-01-11 11:13:40,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:40,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,143 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-11 11:13:40,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:40,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:40,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:40,645 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,670 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-11 11:13:40,671 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:40,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:40,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:40,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:40,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-11 11:13:40,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:40,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-11 11:13:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:41,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:41,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:41,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:41,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:41,138 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-01-11 11:13:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:43,940 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-01-11 11:13:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:43,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:43,942 INFO L225 Difference]: With dead ends: 62 [2019-01-11 11:13:43,943 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:13:43,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:13:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-01-11 11:13:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:13:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-01-11 11:13:43,953 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-01-11 11:13:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:43,954 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-01-11 11:13:43,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-01-11 11:13:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:43,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:43,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:43,955 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-11 11:13:43,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:43,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:43,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:44,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:44,058 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:44,058 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-11 11:13:44,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:44,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:44,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:44,067 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:44,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:44,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:44,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:44,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:44,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:44,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:44,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:44,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,160 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 24 treesize of output 30 [2019-01-11 11:13:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,167 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 26 treesize of output 40 [2019-01-11 11:13:44,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:44,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:44,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:44,203 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,273 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,349 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-11 11:13:44,350 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:44,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:44,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:44,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:44,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,529 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:44,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:13:44,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:44,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:13:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:44,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:44,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:44,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:44,837 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-01-11 11:13:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:47,624 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-01-11 11:13:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:47,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:47,626 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:13:47,626 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 11:13:47,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 11:13:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-11 11:13:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:13:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-11 11:13:47,636 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-11 11:13:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:47,636 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-11 11:13:47,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-11 11:13:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:47,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:47,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:47,637 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-11 11:13:47,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:47,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:47,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:47,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:47,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:47,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:47,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:47,763 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-11 11:13:47,764 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:47,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:47,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:47,770 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:47,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:47,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:47,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:47,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:47,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:47,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:47,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:47,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,840 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 24 treesize of output 30 [2019-01-11 11:13:47,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,848 INFO 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 26 treesize of output 40 [2019-01-11 11:13:47,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:47,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:47,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:47,939 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:48,076 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,104 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-11 11:13:48,105 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:48,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:48,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:48,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:48,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:48,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:13:48,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:48,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:13:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:48,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:48,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:48,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:48,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:48,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:48,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:48,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:48,556 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-11 11:13:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:51,290 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-11 11:13:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:51,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:51,291 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:13:51,291 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:51,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 11:13:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 11:13:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-11 11:13:51,300 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-11 11:13:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:51,301 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-11 11:13:51,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-11 11:13:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:51,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:51,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:51,302 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-11 11:13:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:51,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:51,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:51,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:51,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:51,413 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-11 11:13:51,414 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:51,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:51,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:51,421 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:51,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:51,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:51,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:51,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:51,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:51,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:51,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:51,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,508 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 24 treesize of output 30 [2019-01-11 11:13:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:13:51,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:51,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:51,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:51,578 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,724 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,810 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-11 11:13:51,811 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:13:51,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:51,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:51,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:13:51,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:52,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-11 11:13:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:52,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:52,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:52,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:52,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:52,252 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-11 11:13:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:54,332 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-11 11:13:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:54,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:54,334 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:13:54,334 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:13:54,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:13:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-11 11:13:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:13:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-11 11:13:54,344 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-11 11:13:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:54,344 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-11 11:13:54,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-11 11:13:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:54,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:54,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:54,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-11 11:13:54,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:54,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:54,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:54,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:54,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:54,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:54,435 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-11 11:13:54,437 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:54,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:54,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:54,443 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:54,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:54,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:54,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:54,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:54,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:54,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:54,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:54,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:54,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,560 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 26 treesize of output 40 [2019-01-11 11:13:54,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:54,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:54,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:54,639 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,685 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:54,775 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:54,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:54,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:54,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:54,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:13:54,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:55,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:55,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:55,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:55,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:55,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:55,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:55,217 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-11 11:13:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:56,865 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-01-11 11:13:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:56,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:56,867 INFO L225 Difference]: With dead ends: 77 [2019-01-11 11:13:56,867 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:13:56,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:13:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-01-11 11:13:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:13:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-01-11 11:13:56,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-01-11 11:13:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:56,878 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-01-11 11:13:56,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-01-11 11:13:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:56,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:56,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:56,879 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-01-11 11:13:56,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:56,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:56,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:56,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:56,975 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-01-11 11:13:56,976 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:56,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:56,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:56,982 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:56,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:56,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:56,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:57,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:57,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:13:57,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,075 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 24 treesize of output 30 [2019-01-11 11:13:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,082 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 26 treesize of output 40 [2019-01-11 11:13:57,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:13:57,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:13:57,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:13:57,135 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,180 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:13:57,277 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,301 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-11 11:13:57,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:13:57,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:57,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:13:57,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:57,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:13:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:57,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:57,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:57,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:57,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:57,951 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-01-11 11:13:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:59,656 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-01-11 11:13:59,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:59,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:59,659 INFO L225 Difference]: With dead ends: 82 [2019-01-11 11:13:59,659 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:13:59,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:13:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-01-11 11:13:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 11:13:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-01-11 11:13:59,671 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-01-11 11:13:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:59,671 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-01-11 11:13:59,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-01-11 11:13:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:59,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:59,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:59,673 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-11 11:13:59,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:59,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:59,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:59,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:59,750 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:59,750 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-11 11:13:59,751 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:59,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:59,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:59,760 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:59,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:59,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:59,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-11 11:13:59,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,821 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 21 treesize of output 24 [2019-01-11 11:13:59,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:13:59,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:13:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-11 11:13:59,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,863 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-11 11:13:59,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-11 11:13:59,878 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,909 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,928 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,942 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:13:59,991 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-11 11:14:02,043 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-11 11:14:02,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:14:02,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:14:02,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-11 11:14:02,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-01-11 11:14:16,195 WARN L181 SmtUtils]: Spent 13.54 s on a formula simplification that was a NOOP. DAG size: 106 [2019-01-11 11:14:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:16,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:16,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:16,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:14:16,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:16,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:14:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:14:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:14:16,330 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-01-11 11:14:49,306 WARN L181 SmtUtils]: Spent 32.93 s on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-01-11 11:14:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:51,621 INFO L93 Difference]: Finished difference Result 59 states and 225 transitions. [2019-01-11 11:14:51,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:14:51,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:14:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:51,622 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:14:51,622 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:14:51,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:14:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:14:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-01-11 11:14:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:14:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 216 transitions. [2019-01-11 11:14:51,634 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 216 transitions. Word has length 4 [2019-01-11 11:14:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:51,635 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 216 transitions. [2019-01-11 11:14:51,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:14:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 216 transitions. [2019-01-11 11:14:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:14:51,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:51,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:14:51,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-11 11:14:51,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:51,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:51,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:51,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:51,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:52,170 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-01-11 11:14:52,470 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-11 11:14:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:52,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:52,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:52,553 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:14:52,553 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-11 11:14:52,554 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:52,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:52,558 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:52,559 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:52,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:52,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:52,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:52,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:52,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:52,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:14:52,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:14:52,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,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 26 treesize of output 40 [2019-01-11 11:14:52,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:52,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:52,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:52,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:14:52,857 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:52,882 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-11 11:14:52,883 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:14:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:52,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:52,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:14:53,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:14:53,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:53,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:14:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:53,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:53,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:53,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:53,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:53,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:53,426 INFO L87 Difference]: Start difference. First operand 48 states and 216 transitions. Second operand 8 states. [2019-01-11 11:14:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:55,708 INFO L93 Difference]: Finished difference Result 84 states and 281 transitions. [2019-01-11 11:14:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:55,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:14:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:55,710 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:14:55,710 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:14:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:14:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2019-01-11 11:14:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:14:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 244 transitions. [2019-01-11 11:14:55,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 244 transitions. Word has length 4 [2019-01-11 11:14:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:55,723 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 244 transitions. [2019-01-11 11:14:55,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 244 transitions. [2019-01-11 11:14:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:14:55,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:55,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:14:55,724 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-11 11:14:55,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:55,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:55,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:55,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:55,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:55,833 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:14:55,833 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-11 11:14:55,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:55,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:55,838 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:55,839 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:55,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:55,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:55,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:55,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:55,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:55,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:55,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:14:55,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,905 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 24 treesize of output 30 [2019-01-11 11:14:55,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:55,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:14:55,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:14:55,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:55,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:14:55,967 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:14:56,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,123 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-11 11:14:56,123 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:14:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:14:56,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:56,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:14:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:56,325 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:56,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:14:56,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:56,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:14:56,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:14:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:56,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:56,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:56,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:56,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:56,716 INFO L87 Difference]: Start difference. First operand 52 states and 244 transitions. Second operand 8 states. [2019-01-11 11:15:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:00,287 INFO L93 Difference]: Finished difference Result 85 states and 287 transitions. [2019-01-11 11:15:00,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:00,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:15:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:00,290 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:15:00,290 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:15:00,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:15:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2019-01-11 11:15:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 11:15:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 251 transitions. [2019-01-11 11:15:00,318 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 251 transitions. Word has length 4 [2019-01-11 11:15:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:00,318 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 251 transitions. [2019-01-11 11:15:00,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 251 transitions. [2019-01-11 11:15:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:15:00,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:00,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:15:00,320 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-11 11:15:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:00,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:00,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:00,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:00,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:00,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:00,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:15:00,470 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-11 11:15:00,472 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:00,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:00,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:00,478 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:15:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:00,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:00,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:00,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:00,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:00,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:00,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:00,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:15:00,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:15:00,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:15:00,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-11 11:15:00,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:15:00,756 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:00,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:00,861 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:34, output treesize:43 [2019-01-11 11:15:02,881 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-11 11:15:02,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:02,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:15:02,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:02,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:02,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:02,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:02,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:15:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:15:02,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:15:02,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:15:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:15:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:15:02,987 INFO L87 Difference]: Start difference. First operand 53 states and 251 transitions. Second operand 4 states. [2019-01-11 11:15:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:03,054 INFO L93 Difference]: Finished difference Result 84 states and 422 transitions. [2019-01-11 11:15:03,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:15:03,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:15:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:03,055 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:15:03,055 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:15:03,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:15:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:15:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2019-01-11 11:15:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:15:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 416 transitions. [2019-01-11 11:15:03,072 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 416 transitions. Word has length 4 [2019-01-11 11:15:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:03,073 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 416 transitions. [2019-01-11 11:15:03,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:15:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 416 transitions. [2019-01-11 11:15:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:15:03,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:03,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:15:03,074 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-11 11:15:03,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:03,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:03,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:03,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:03,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:03,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:03,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:03,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:15:03,157 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-11 11:15:03,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:03,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:03,163 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:03,164 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:03,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:03,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:03,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:03,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:03,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:03,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:03,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:15:03,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:03,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,291 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 24 treesize of output 30 [2019-01-11 11:15:03,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,297 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 26 treesize of output 40 [2019-01-11 11:15:03,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:03,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:03,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:03,322 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,458 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,539 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-11 11:15:03,539 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:15:03,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:15:03,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:03,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:15:03,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:03,764 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-11 11:15:03,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:15:03,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:03,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:03,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-11 11:15:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:03,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:04,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:04,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:15:04,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:04,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:04,029 INFO L87 Difference]: Start difference. First operand 76 states and 416 transitions. Second operand 8 states. [2019-01-11 11:15:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:06,145 INFO L93 Difference]: Finished difference Result 114 states and 499 transitions. [2019-01-11 11:15:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:06,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:15:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:06,148 INFO L225 Difference]: With dead ends: 114 [2019-01-11 11:15:06,148 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 11:15:06,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 11:15:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2019-01-11 11:15:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:15:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 460 transitions. [2019-01-11 11:15:06,165 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 460 transitions. Word has length 4 [2019-01-11 11:15:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:06,165 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 460 transitions. [2019-01-11 11:15:06,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 460 transitions. [2019-01-11 11:15:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:15:06,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:06,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:15:06,166 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-11 11:15:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:06,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:06,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:06,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:06,503 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-11 11:15:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:06,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:06,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:06,512 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:15:06,512 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-11 11:15:06,513 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:06,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:06,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:06,516 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:15:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:06,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:06,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:06,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:06,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:06,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:06,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:06,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:15:06,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:15:06,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:15:06,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,713 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-11 11:15: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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-11 11:15:06,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:06,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:15:06,732 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,760 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,802 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:06,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:06,833 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:34, output treesize:43 [2019-01-11 11:15:07,008 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-11 11:15:07,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:15:07,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:07,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:15:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:07,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:07,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:07,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:15:07,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:07,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:15:07,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:15:07,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:15:07,117 INFO L87 Difference]: Start difference. First operand 84 states and 460 transitions. Second operand 6 states. [2019-01-11 11:15:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:07,330 INFO L93 Difference]: Finished difference Result 103 states and 478 transitions. [2019-01-11 11:15:07,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:15:07,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:15:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:07,331 INFO L225 Difference]: With dead ends: 103 [2019-01-11 11:15:07,332 INFO L226 Difference]: Without dead ends: 102 [2019-01-11 11:15:07,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:15:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-11 11:15:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2019-01-11 11:15:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:15:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 460 transitions. [2019-01-11 11:15:07,348 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 460 transitions. Word has length 4 [2019-01-11 11:15:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:07,348 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 460 transitions. [2019-01-11 11:15:07,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:15:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 460 transitions. [2019-01-11 11:15:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:15:07,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:07,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:15:07,350 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash 29171926, now seen corresponding path program 1 times [2019-01-11 11:15:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:07,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:07,614 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-11 11:15:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:07,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:07,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:07,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:15:07,659 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-11 11:15:07,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:07,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:07,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:07,664 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:07,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:07,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:07,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:07,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:07,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:07,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:07,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:07,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:15:07,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:15:07,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:07,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:07,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:07,814 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,852 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:15:07,940 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,963 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-11 11:15:07,963 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:15:07,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:15:08,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:08,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:15:08,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,502 INFO L303 Elim1Store]: Index analysis took 408 ms [2019-01-11 11:15:08,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:15:08,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:09,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-11 11:15:09,430 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-11 11:15:09,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,789 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:09,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:09,790 INFO L303 Elim1Store]: Index analysis took 355 ms [2019-01-11 11:15:09,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:15:09,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:09,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:09,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:15:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:09,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:09,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:15:09,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:09,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:09,996 INFO L87 Difference]: Start difference. First operand 84 states and 460 transitions. Second operand 10 states. [2019-01-11 11:15:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:12,389 INFO L93 Difference]: Finished difference Result 154 states and 699 transitions. [2019-01-11 11:15:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:12,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:15:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:12,391 INFO L225 Difference]: With dead ends: 154 [2019-01-11 11:15:12,392 INFO L226 Difference]: Without dead ends: 151 [2019-01-11 11:15:12,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:15:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-11 11:15:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 96. [2019-01-11 11:15:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:15:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 529 transitions. [2019-01-11 11:15:12,409 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 529 transitions. Word has length 5 [2019-01-11 11:15:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:12,409 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 529 transitions. [2019-01-11 11:15:12,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:15:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 529 transitions. [2019-01-11 11:15:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:15:12,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:12,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:15:12,411 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-11 11:15:12,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:12,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:12,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:12,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:12,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:12,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:12,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:12,506 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:15:12,507 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-11 11:15:12,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:12,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:12,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:12,512 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:12,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:12,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:12,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:12,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:12,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:12,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:12,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:12,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:12,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 24 treesize of output 30 [2019-01-11 11:15:12,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,622 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 26 treesize of output 36 [2019-01-11 11:15:12,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,631 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 28 treesize of output 46 [2019-01-11 11:15:12,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,647 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-11 11:15:12,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:12,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-11 11:15:12,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,692 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-11 11:15:12,788 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:12,820 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-11 11:15:12,821 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-11 11:15:14,837 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 11:15:14,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 79 [2019-01-11 11:15:14,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:15,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 11:15:15,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:88 [2019-01-11 11:15:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 117 [2019-01-11 11:15:15,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:15:15,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,667 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:15,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 84 [2019-01-11 11:15:15,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-11 11:15:15,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:110, output treesize:204 [2019-01-11 11:15:27,017 WARN L181 SmtUtils]: Spent 9.08 s on a formula simplification that was a NOOP. DAG size: 110 [2019-01-11 11:15:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:27,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:27,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:27,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:15:27,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:27,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=64, Unknown=1, NotChecked=0, Total=110 [2019-01-11 11:15:27,115 INFO L87 Difference]: Start difference. First operand 96 states and 529 transitions. Second operand 8 states. [2019-01-11 11:15:52,745 WARN L181 SmtUtils]: Spent 21.03 s on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-01-11 11:15:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:56,644 INFO L93 Difference]: Finished difference Result 117 states and 575 transitions. [2019-01-11 11:15:56,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:56,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:15:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:56,646 INFO L225 Difference]: With dead ends: 117 [2019-01-11 11:15:56,646 INFO L226 Difference]: Without dead ends: 116 [2019-01-11 11:15:56,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=64, Invalid=89, Unknown=3, NotChecked=0, Total=156 [2019-01-11 11:15:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-11 11:15:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2019-01-11 11:15:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 11:15:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-01-11 11:15:56,660 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-01-11 11:15:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:56,661 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-01-11 11:15:56,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-01-11 11:15:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:15:56,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:56,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:15:56,662 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:56,662 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-11 11:15:56,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:56,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:56,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:56,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:56,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:56,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:56,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:15:56,797 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-11 11:15:56,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:56,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:56,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:56,801 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:15:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:56,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:56,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:56,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:15:56,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:56,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:56,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:56,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:15:56,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:15:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:15:56,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,878 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 26 treesize of output 40 [2019-01-11 11:15:56,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:15:56,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:15:56,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:56,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:15:56,928 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,023 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,087 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-11 11:15:57,088 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:15:57,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:15:57,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:15:57,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-11 11:15:57,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-11 11:15:57,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,389 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:57,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:15:57,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:57,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:15:57,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:15:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:57,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:57,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:57,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:15:57,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:57,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:15:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:15:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:15:57,753 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-01-11 11:16:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:01,022 INFO L93 Difference]: Finished difference Result 136 states and 615 transitions. [2019-01-11 11:16:01,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:01,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:16:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:01,025 INFO L225 Difference]: With dead ends: 136 [2019-01-11 11:16:01,025 INFO L226 Difference]: Without dead ends: 134 [2019-01-11 11:16:01,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-11 11:16:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2019-01-11 11:16:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:16:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 521 transitions. [2019-01-11 11:16:01,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 521 transitions. Word has length 5 [2019-01-11 11:16:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:01,044 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 521 transitions. [2019-01-11 11:16:01,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 521 transitions. [2019-01-11 11:16:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:16:01,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:01,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:16:01,045 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-11 11:16:01,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:01,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:01,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:01,205 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-11 11:16:01,475 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-11 11:16:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:01,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:01,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:01,482 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:16:01,482 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-11 11:16:01,483 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:01,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:01,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:01,489 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:01,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:01,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:01,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:01,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:01,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:01,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:01,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:16:01,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,549 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 24 treesize of output 30 [2019-01-11 11:16:01,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:16:01,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:01,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:01,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:01,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,617 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,638 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:16:01,707 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,730 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-11 11:16:01,730 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:16:01,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:16:01,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:01,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:16:01,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:01,877 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:01,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:16:01,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:01,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:01,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-11 11:16:02,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:02,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:02,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-11 11:16:02,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:02,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:02,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:48 [2019-01-11 11:16:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:02,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:02,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:02,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:02,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:02,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:02,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:02,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:02,416 INFO L87 Difference]: Start difference. First operand 95 states and 521 transitions. Second operand 10 states. [2019-01-11 11:16:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:06,520 INFO L93 Difference]: Finished difference Result 128 states and 575 transitions. [2019-01-11 11:16:06,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:06,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:16:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:06,523 INFO L225 Difference]: With dead ends: 128 [2019-01-11 11:16:06,524 INFO L226 Difference]: Without dead ends: 127 [2019-01-11 11:16:06,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-11 11:16:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2019-01-11 11:16:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 11:16:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 521 transitions. [2019-01-11 11:16:06,543 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 521 transitions. Word has length 5 [2019-01-11 11:16:06,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:06,543 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 521 transitions. [2019-01-11 11:16:06,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 521 transitions. [2019-01-11 11:16:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:16:06,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:06,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:16:06,544 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-11 11:16:06,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:06,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:06,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:06,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:06,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:06,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:16:06,688 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-11 11:16:06,689 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:06,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:06,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:06,692 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:06,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:06,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:06,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:06,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:06,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:06,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:06,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:16:06,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:16:06,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,773 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 24 treesize of output 30 [2019-01-11 11:16:06,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,777 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 26 treesize of output 40 [2019-01-11 11:16:06,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:06,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:06,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:06,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,927 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-11 11:16:06,927 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:16:06,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:16:06,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:07,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:16:07,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:07,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-11 11:16:07,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:07,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:16:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:16:07,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:07,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:50 [2019-01-11 11:16:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:07,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:07,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:16:07,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:07,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:07,450 INFO L87 Difference]: Start difference. First operand 95 states and 521 transitions. Second operand 10 states. [2019-01-11 11:16:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:09,463 INFO L93 Difference]: Finished difference Result 146 states and 698 transitions. [2019-01-11 11:16:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:09,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:16:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:09,467 INFO L225 Difference]: With dead ends: 146 [2019-01-11 11:16:09,467 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:16:09,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:16:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:16:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2019-01-11 11:16:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 11:16:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 619 transitions. [2019-01-11 11:16:09,489 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 619 transitions. Word has length 5 [2019-01-11 11:16:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:09,489 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 619 transitions. [2019-01-11 11:16:09,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 619 transitions. [2019-01-11 11:16:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:16:09,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:09,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:16:09,490 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-11 11:16:09,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:09,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:09,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:09,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:09,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:09,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:09,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:16:09,624 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-11 11:16:09,625 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:09,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:09,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:09,630 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:09,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:09,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:09,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:09,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:09,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:09,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:16:09,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:16:09,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:09,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,742 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 26 treesize of output 40 [2019-01-11 11:16:09,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:09,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:09,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:09,768 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,805 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:09,889 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-11 11:16:09,889 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:16:09,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:09,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:16:09,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:10,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:16:10,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:16:10,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:10,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-11 11:16:10,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,190 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:10,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:10,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:16:10,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:10,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:10,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:16:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:10,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:10,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:10,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:10,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:10,562 INFO L87 Difference]: Start difference. First operand 109 states and 619 transitions. Second operand 10 states. [2019-01-11 11:16:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:13,905 INFO L93 Difference]: Finished difference Result 147 states and 692 transitions. [2019-01-11 11:16:13,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:13,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:16:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:13,908 INFO L225 Difference]: With dead ends: 147 [2019-01-11 11:16:13,908 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:16:13,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:16:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:16:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2019-01-11 11:16:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 11:16:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 584 transitions. [2019-01-11 11:16:13,923 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 584 transitions. Word has length 5 [2019-01-11 11:16:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:13,924 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 584 transitions. [2019-01-11 11:16:13,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 584 transitions. [2019-01-11 11:16:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:16:13,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:13,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:16:13,925 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash 28825532, now seen corresponding path program 2 times [2019-01-11 11:16:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:13,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:13,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:13,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:13,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:14,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:14,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:14,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:14,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:14,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:14,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:14,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:14,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:14,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:16:14,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:14,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:14,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:16:14,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,139 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 24 treesize of output 30 [2019-01-11 11:16:14,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,143 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 26 treesize of output 40 [2019-01-11 11:16:14,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:16:14,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:16:14,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:16:14,169 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,206 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:16:14,298 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,319 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-11 11:16:14,320 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:16:14,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:16:14,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:14,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:16:14,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:16:14,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:14,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:16:14,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,600 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:14,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:14,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-11 11:16:14,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:14,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:16:14,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:16:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:14,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:14,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:14,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:16:14,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:16:14,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:16:14,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:14,881 INFO L87 Difference]: Start difference. First operand 104 states and 584 transitions. Second operand 10 states. [2019-01-11 11:16:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:18,042 INFO L93 Difference]: Finished difference Result 162 states and 738 transitions. [2019-01-11 11:16:18,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:16:18,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:16:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:18,044 INFO L225 Difference]: With dead ends: 162 [2019-01-11 11:16:18,045 INFO L226 Difference]: Without dead ends: 161 [2019-01-11 11:16:18,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-11 11:16:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2019-01-11 11:16:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-11 11:16:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 626 transitions. [2019-01-11 11:16:18,067 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 626 transitions. Word has length 5 [2019-01-11 11:16:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:18,068 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 626 transitions. [2019-01-11 11:16:18,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:16:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 626 transitions. [2019-01-11 11:16:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:16:18,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:18,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:16:18,069 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-11 11:16:18,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:18,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:16:18,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:18,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:18,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:18,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:18,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:16:18,156 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-11 11:16:18,156 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:18,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:18,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:18,159 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:18,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:18,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:18,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:18,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:18,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:18,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-11 11:16:18,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,216 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 21 treesize of output 24 [2019-01-11 11:16:18,219 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 24 treesize of output 30 [2019-01-11 11:16:18,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,224 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 26 treesize of output 36 [2019-01-11 11:16:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,232 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 28 treesize of output 46 [2019-01-11 11:16:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-11 11:16:18,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:18,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-11 11:16:18,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,290 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:18,521 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-11 11:16:18,522 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-11 11:16:19,341 WARN L181 SmtUtils]: Spent 814.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 11:16:19,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:19,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:16:19,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:16:19,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:16:19,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:196 [2019-01-11 11:16:19,960 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-01-11 11:16:20,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,211 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:20,211 INFO L303 Elim1Store]: Index analysis took 244 ms [2019-01-11 11:16:20,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 84 [2019-01-11 11:16:20,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 90 [2019-01-11 11:16:20,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,619 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:20,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-11 11:16:20,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:20,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-11 11:16:20,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:20,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:20,991 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:20,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 117 [2019-01-11 11:16:20,992 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:21,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-11 11:16:21,161 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 26 variables, input treesize:246, output treesize:200 [2019-01-11 11:16:21,929 WARN L181 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 11:16:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:21,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:21,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:21,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:16:21,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:21,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:16:21,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:16:21,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:16:21,978 INFO L87 Difference]: Start difference. First operand 110 states and 626 transitions. Second operand 8 states. [2019-01-11 11:16:26,778 WARN L181 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-01-11 11:16:32,851 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-01-11 11:16:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:40,504 INFO L93 Difference]: Finished difference Result 145 states and 689 transitions. [2019-01-11 11:16:40,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:16:40,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:16:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:40,507 INFO L225 Difference]: With dead ends: 145 [2019-01-11 11:16:40,507 INFO L226 Difference]: Without dead ends: 141 [2019-01-11 11:16:40,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-11 11:16:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2019-01-11 11:16:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 11:16:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 651 transitions. [2019-01-11 11:16:40,528 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 651 transitions. Word has length 5 [2019-01-11 11:16:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:40,528 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 651 transitions. [2019-01-11 11:16:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:16:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 651 transitions. [2019-01-11 11:16:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:16:40,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:40,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:16:40,530 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-11 11:16:40,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:40,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:40,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:40,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:40,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:16:40,642 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-11 11:16:40,643 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:40,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:40,646 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:40,646 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:40,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:40,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:40,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:16:40,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:40,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:40,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:40,682 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 21 treesize of output 24 [2019-01-11 11:16:40,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:16:40,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,693 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 26 treesize of output 36 [2019-01-11 11:16:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,702 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 28 treesize of output 46 [2019-01-11 11:16:40,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-11 11:16:40,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-11 11:16:40,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-11 11:16:40,844 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:40,866 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-11 11:16:40,866 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-11 11:16:40,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:40,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:16:40,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:16:41,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:16:41,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:196 [2019-01-11 11:16:41,365 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-11 11:16:41,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 90 [2019-01-11 11:16:41,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 123 [2019-01-11 11:16:41,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,802 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:41,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 84 [2019-01-11 11:16:41,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:41,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:41,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 98 [2019-01-11 11:16:41,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:42,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 98 [2019-01-11 11:16:42,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:42,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-11 11:16:42,291 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 26 variables, input treesize:246, output treesize:196 [2019-01-11 11:16:46,848 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 110 [2019-01-11 11:16:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:46,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:46,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:46,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:16:46,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:46,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:16:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:16:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=64, Unknown=1, NotChecked=0, Total=110 [2019-01-11 11:16:46,905 INFO L87 Difference]: Start difference. First operand 116 states and 651 transitions. Second operand 8 states. [2019-01-11 11:16:47,462 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-01-11 11:16:55,239 WARN L181 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-01-11 11:17:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:01,919 INFO L93 Difference]: Finished difference Result 144 states and 719 transitions. [2019-01-11 11:17:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:17:01,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:17:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:01,922 INFO L225 Difference]: With dead ends: 144 [2019-01-11 11:17:01,922 INFO L226 Difference]: Without dead ends: 143 [2019-01-11 11:17:01,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=64, Invalid=91, Unknown=1, NotChecked=0, Total=156 [2019-01-11 11:17:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-11 11:17:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2019-01-11 11:17:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 11:17:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 700 transitions. [2019-01-11 11:17:01,950 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 700 transitions. Word has length 5 [2019-01-11 11:17:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:01,950 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 700 transitions. [2019-01-11 11:17:01,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:17:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 700 transitions. [2019-01-11 11:17:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:17:01,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:01,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:17:01,952 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-11 11:17:01,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:01,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:01,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:01,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:02,196 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-11 11:17:02,244 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-11 11:17:02,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:17:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:17:02,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:17:02,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:17:02,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:17:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:17:02,245 INFO L87 Difference]: Start difference. First operand 123 states and 700 transitions. Second operand 4 states. [2019-01-11 11:17:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:02,360 INFO L93 Difference]: Finished difference Result 132 states and 708 transitions. [2019-01-11 11:17:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:17:02,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:17:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:02,362 INFO L225 Difference]: With dead ends: 132 [2019-01-11 11:17:02,362 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 11:17:02,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:17:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 11:17:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2019-01-11 11:17:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:17:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 697 transitions. [2019-01-11 11:17:02,382 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 697 transitions. Word has length 5 [2019-01-11 11:17:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:02,382 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 697 transitions. [2019-01-11 11:17:02,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:17:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 697 transitions. [2019-01-11 11:17:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:17:02,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:02,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:17:02,383 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-11 11:17:02,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:02,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:02,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:02,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:02,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:02,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:02,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:02,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:17:02,474 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-11 11:17:02,475 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:02,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:02,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:02,479 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:17:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:02,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:02,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:02,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:02,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:02,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:02,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:02,646 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 11:17:02,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 21 treesize of output 24 [2019-01-11 11:17:02,651 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 24 treesize of output 30 [2019-01-11 11:17:02,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,656 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 26 treesize of output 36 [2019-01-11 11:17:02,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,666 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 28 treesize of output 46 [2019-01-11 11:17:02,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-11 11:17:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-11 11:17:02,688 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-11 11:17:02,802 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:02,824 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-11 11:17:02,825 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-11 11:17:02,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:02,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-11 11:17:02,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:17:03,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:17:03,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:196 [2019-01-11 11:17:10,305 WARN L181 SmtUtils]: Spent 7.13 s on a formula simplification that was a NOOP. DAG size: 91 [2019-01-11 11:17:10,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 90 [2019-01-11 11:17:10,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:10,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:10,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-11 11:17:10,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:10,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:10,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 109 [2019-01-11 11:17:10,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:10,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:10,897 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:10,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-11 11:17:10,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:11,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:11,067 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:11,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-11 11:17:11,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:11,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-11 11:17:11,210 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 26 variables, input treesize:246, output treesize:200 [2019-01-11 11:17:13,356 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 11:17:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:13,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:13,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:13,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:17:13,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:13,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:17:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:17:13,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:17:13,408 INFO L87 Difference]: Start difference. First operand 121 states and 697 transitions. Second operand 8 states. [2019-01-11 11:17:30,425 WARN L181 SmtUtils]: Spent 16.79 s on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-01-11 11:17:43,817 WARN L181 SmtUtils]: Spent 10.76 s on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-01-11 11:17:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:49,273 INFO L93 Difference]: Finished difference Result 157 states and 755 transitions. [2019-01-11 11:17:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:17:49,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:17:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:49,276 INFO L225 Difference]: With dead ends: 157 [2019-01-11 11:17:49,276 INFO L226 Difference]: Without dead ends: 155 [2019-01-11 11:17:49,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:17:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-11 11:17:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-01-11 11:17:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-11 11:17:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 711 transitions. [2019-01-11 11:17:49,307 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 711 transitions. Word has length 5 [2019-01-11 11:17:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:49,307 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 711 transitions. [2019-01-11 11:17:49,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:17:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 711 transitions. [2019-01-11 11:17:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:17:49,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:49,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:17:49,308 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 29302622, now seen corresponding path program 1 times [2019-01-11 11:17:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:49,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:49,510 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2019-01-11 11:17:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:49,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:49,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:49,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:17:49,570 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-11 11:17:49,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:49,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:49,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:49,574 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:49,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:49,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:49,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:49,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:49,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:49,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:49,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:17:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,636 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 24 treesize of output 30 [2019-01-11 11:17:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:17:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:17:49,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:17:49,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:17:49,675 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:17:49,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,828 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-11 11:17:49,828 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:17:49,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:17:49,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:49,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:17:49,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:17:49,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:50,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:50,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:17:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:50,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:50,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:17:50,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:50,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:50,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:17:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:50,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:50,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:50,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:17:50,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:50,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:17:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:17:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:17:50,494 INFO L87 Difference]: Start difference. First operand 123 states and 711 transitions. Second operand 10 states. [2019-01-11 11:17:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:54,278 INFO L93 Difference]: Finished difference Result 169 states and 820 transitions. [2019-01-11 11:17:54,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:17:54,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:17:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:54,283 INFO L225 Difference]: With dead ends: 169 [2019-01-11 11:17:54,283 INFO L226 Difference]: Without dead ends: 162 [2019-01-11 11:17:54,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-11 11:17:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2019-01-11 11:17:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:17:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 779 transitions. [2019-01-11 11:17:54,317 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 779 transitions. Word has length 5 [2019-01-11 11:17:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:54,317 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 779 transitions. [2019-01-11 11:17:54,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:17:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 779 transitions. [2019-01-11 11:17:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:17:54,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:54,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:17:54,319 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-11 11:17:54,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:54,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:54,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:54,638 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-11 11:17:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:54,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:54,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:54,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:17:54,660 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-11 11:17:54,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:54,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:54,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:54,663 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:17:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:54,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:54,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:54,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:54,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:54,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:54,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:54,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:17:54,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:17:54,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:17:54,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:17:54,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-11 11:17:54,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:17:54,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,761 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:54,832 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-11 11:17:54,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:17:54,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:54,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:54,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:54,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:54,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 11:17:54,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:55,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:17:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:55,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:55,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:17:55,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:55,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:17:55,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:17:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:17:55,071 INFO L87 Difference]: Start difference. First operand 132 states and 779 transitions. Second operand 8 states. [2019-01-11 11:17:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:55,617 INFO L93 Difference]: Finished difference Result 150 states and 794 transitions. [2019-01-11 11:17:55,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:17:55,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:17:55,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:55,620 INFO L225 Difference]: With dead ends: 150 [2019-01-11 11:17:55,620 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 11:17:55,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:17:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 11:17:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2019-01-11 11:17:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 11:17:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 777 transitions. [2019-01-11 11:17:55,643 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 777 transitions. Word has length 5 [2019-01-11 11:17:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:55,643 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 777 transitions. [2019-01-11 11:17:55,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:17:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 777 transitions. [2019-01-11 11:17:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:17:55,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:55,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:17:55,644 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:55,644 INFO L82 PathProgramCache]: Analyzing trace with hash 29302312, now seen corresponding path program 1 times [2019-01-11 11:17:55,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:55,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:55,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:55,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:55,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:55,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:55,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:17:55,796 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [27] [2019-01-11 11:17:55,797 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:55,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:55,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:55,800 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:55,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:55,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:55,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:55,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:55,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:55,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:17:55,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:17:55,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:17:55,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:17:55,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:17:55,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:55,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:17:55,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,929 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:55,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:17:56,019 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,042 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-11 11:17:56,042 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:17:56,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:17:56,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:56,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:17:56,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:17:56,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:56,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:17:56,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:56,348 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:56,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:17:56,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:56,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:56,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-11 11:17:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:56,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:17:56,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:56,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:17:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:17:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:17:56,694 INFO L87 Difference]: Start difference. First operand 131 states and 777 transitions. Second operand 10 states. [2019-01-11 11:17:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:59,303 INFO L93 Difference]: Finished difference Result 172 states and 877 transitions. [2019-01-11 11:17:59,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:17:59,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:17:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:59,307 INFO L225 Difference]: With dead ends: 172 [2019-01-11 11:17:59,307 INFO L226 Difference]: Without dead ends: 168 [2019-01-11 11:17:59,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-11 11:17:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 140. [2019-01-11 11:17:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-11 11:17:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 839 transitions. [2019-01-11 11:17:59,336 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 839 transitions. Word has length 5 [2019-01-11 11:17:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:59,336 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 839 transitions. [2019-01-11 11:17:59,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:17:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 839 transitions. [2019-01-11 11:17:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:17:59,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:59,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:17:59,338 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash 29290904, now seen corresponding path program 1 times [2019-01-11 11:17:59,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:59,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:59,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:59,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:59,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:59,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:59,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:59,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:17:59,481 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [27] [2019-01-11 11:17:59,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:59,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:59,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:59,485 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:59,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:59,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:59,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:17:59,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:59,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:59,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:59,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:17:59,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:17:59,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,557 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 24 treesize of output 30 [2019-01-11 11:17:59,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,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 26 treesize of output 40 [2019-01-11 11:17:59,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:17:59,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:17:59,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:17:59,613 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,689 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,736 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-11 11:17:59,736 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:17:59,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:17:59,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:59,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:17:59,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:59,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-11 11:17:59,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:59,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:17:59,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:17:59,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:59,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-11 11:17:59,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:00,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:00,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:00,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:00,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:00,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:18:00,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:00,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:00,194 INFO L87 Difference]: Start difference. First operand 140 states and 839 transitions. Second operand 10 states. [2019-01-11 11:18:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:02,324 INFO L93 Difference]: Finished difference Result 197 states and 973 transitions. [2019-01-11 11:18:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:18:02,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:02,328 INFO L225 Difference]: With dead ends: 197 [2019-01-11 11:18:02,328 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 11:18:02,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:18:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 11:18:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2019-01-11 11:18:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-11 11:18:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 864 transitions. [2019-01-11 11:18:02,365 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 864 transitions. Word has length 5 [2019-01-11 11:18:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:02,365 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 864 transitions. [2019-01-11 11:18:02,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 864 transitions. [2019-01-11 11:18:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:02,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:02,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:02,367 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-11 11:18:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:02,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:02,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:02,524 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-01-11 11:18:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:02,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:02,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:02,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:02,581 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-11 11:18:02,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:02,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:02,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:02,586 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:02,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:02,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:02,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:02,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:02,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:02,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:02,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:18:02,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:02,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,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 24 treesize of output 30 [2019-01-11 11:18:02,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,660 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 26 treesize of output 40 [2019-01-11 11:18:02,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:18:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:18:02,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:18:02,684 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,722 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,742 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,780 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,801 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-11 11:18:02,802 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:18:02,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:18:02,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:02,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:02,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:02,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:02,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:18:02,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:03,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:03,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:03,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:03,097 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:03,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 11:18:03,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:03,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:03,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:18:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:03,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:03,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:03,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:18:03,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:03,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:18:03,562 INFO L87 Difference]: Start difference. First operand 146 states and 864 transitions. Second operand 10 states. [2019-01-11 11:18:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:06,711 INFO L93 Difference]: Finished difference Result 193 states and 995 transitions. [2019-01-11 11:18:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:18:06,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:06,714 INFO L225 Difference]: With dead ends: 193 [2019-01-11 11:18:06,714 INFO L226 Difference]: Without dead ends: 191 [2019-01-11 11:18:06,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:18:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-11 11:18:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 159. [2019-01-11 11:18:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-11 11:18:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 955 transitions. [2019-01-11 11:18:06,742 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 955 transitions. Word has length 5 [2019-01-11 11:18:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:06,742 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 955 transitions. [2019-01-11 11:18:06,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 955 transitions. [2019-01-11 11:18:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:06,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:06,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:06,743 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:06,743 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-11 11:18:06,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:06,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:06,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:06,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:06,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:06,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:06,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:06,926 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-11 11:18:06,927 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:06,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:06,930 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:06,930 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:06,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:06,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:06,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:06,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:06,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:06,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:07,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:07,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,051 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 24 treesize of output 30 [2019-01-11 11:18:07,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:18:07,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:18:07,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:18:07,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:18:07,083 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:18:07,212 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,235 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-11 11:18:07,236 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:18:07,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:18:07,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:07,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:07,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 11:18:07,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:07,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:07,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:07,520 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:07,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-11 11:18:07,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:07,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:07,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-11 11:18:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:07,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:07,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:07,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:18:07,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:18:07,871 INFO L87 Difference]: Start difference. First operand 159 states and 955 transitions. Second operand 10 states. [2019-01-11 11:18:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:10,328 INFO L93 Difference]: Finished difference Result 205 states and 1081 transitions. [2019-01-11 11:18:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:18:10,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:10,331 INFO L225 Difference]: With dead ends: 205 [2019-01-11 11:18:10,331 INFO L226 Difference]: Without dead ends: 203 [2019-01-11 11:18:10,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:18:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-11 11:18:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 166. [2019-01-11 11:18:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-11 11:18:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 1004 transitions. [2019-01-11 11:18:10,373 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 1004 transitions. Word has length 5 [2019-01-11 11:18:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:10,373 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 1004 transitions. [2019-01-11 11:18:10,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 1004 transitions. [2019-01-11 11:18:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:10,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:10,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:10,375 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-11 11:18:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:10,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:10,884 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-01-11 11:18:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:10,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:10,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:10,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:10,992 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-11 11:18:10,993 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:10,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:10,997 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:10,997 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:18:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:10,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:10,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:10,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:11,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:11,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:11,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:11,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:11,021 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 24 treesize of output 26 [2019-01-11 11:18:11,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:18:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:18:11,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-11 11:18:11,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:18:11,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,096 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:11,166 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-11 11:18:11,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:18:11,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:11,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:11,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:11,291 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:11,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 11:18:11,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:11,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:11,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:11,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:11,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:11,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:18:11,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:11,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:18:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:18:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:18:11,402 INFO L87 Difference]: Start difference. First operand 166 states and 1004 transitions. Second operand 8 states. [2019-01-11 11:18:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:11,846 INFO L93 Difference]: Finished difference Result 189 states and 1032 transitions. [2019-01-11 11:18:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:18:11,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:18:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:11,848 INFO L225 Difference]: With dead ends: 189 [2019-01-11 11:18:11,849 INFO L226 Difference]: Without dead ends: 188 [2019-01-11 11:18:11,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-11 11:18:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2019-01-11 11:18:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-11 11:18:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 1004 transitions. [2019-01-11 11:18:11,878 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 1004 transitions. Word has length 5 [2019-01-11 11:18:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:11,878 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 1004 transitions. [2019-01-11 11:18:11,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:18:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 1004 transitions. [2019-01-11 11:18:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:11,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:11,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:11,879 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash 29350486, now seen corresponding path program 2 times [2019-01-11 11:18:11,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:11,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:11,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:11,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:11,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:12,204 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-01-11 11:18:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:12,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:12,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:12,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:18:12,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:18:12,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:12,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:12,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:18:12,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:18:12,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:18:12,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:18:12,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:12,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:12,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,310 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 24 treesize of output 30 [2019-01-11 11:18:12,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,314 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 26 treesize of output 40 [2019-01-11 11:18:12,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:18:12,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:18:12,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:18:12,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:18:12,469 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,492 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-11 11:18:12,492 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:18:12,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:18:12,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:12,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:12,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:18:12,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:12,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-11 11:18:12,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:12,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:12,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-11 11:18:12,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:12,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:12,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:18:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:12,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:12,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:12,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:18:12,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:12,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:12,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:12,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:12,956 INFO L87 Difference]: Start difference. First operand 166 states and 1004 transitions. Second operand 10 states. [2019-01-11 11:18:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:14,850 INFO L93 Difference]: Finished difference Result 250 states and 1294 transitions. [2019-01-11 11:18:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:18:14,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:14,854 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:18:14,854 INFO L226 Difference]: Without dead ends: 248 [2019-01-11 11:18:14,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:18:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-11 11:18:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 184. [2019-01-11 11:18:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-11 11:18:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 1130 transitions. [2019-01-11 11:18:14,884 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 1130 transitions. Word has length 5 [2019-01-11 11:18:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:14,885 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 1130 transitions. [2019-01-11 11:18:14,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 1130 transitions. [2019-01-11 11:18:14,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:14,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:14,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:14,886 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:14,886 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-11 11:18:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:14,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:18:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:14,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:15,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:15,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:15,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:15,002 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-11 11:18:15,005 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:15,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:15,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:15,008 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:18:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:15,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:15,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:15,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:15,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:15,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:15,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:15,034 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 24 treesize of output 26 [2019-01-11 11:18:15,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:18:15,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:18:15,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-11 11:18:15,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:18:15,076 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,105 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:15,176 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-11 11:18:15,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:18:15,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:15,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:15,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:18:15,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:15,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:15,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:18:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:15,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:15,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:15,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:18:15,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:15,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:18:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:18:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:18:15,462 INFO L87 Difference]: Start difference. First operand 184 states and 1130 transitions. Second operand 8 states. [2019-01-11 11:18:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:16,014 INFO L93 Difference]: Finished difference Result 212 states and 1156 transitions. [2019-01-11 11:18:16,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:18:16,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:18:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:16,017 INFO L225 Difference]: With dead ends: 212 [2019-01-11 11:18:16,018 INFO L226 Difference]: Without dead ends: 210 [2019-01-11 11:18:16,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-11 11:18:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2019-01-11 11:18:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-11 11:18:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 1135 transitions. [2019-01-11 11:18:16,060 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 1135 transitions. Word has length 5 [2019-01-11 11:18:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:16,060 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 1135 transitions. [2019-01-11 11:18:16,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:18:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 1135 transitions. [2019-01-11 11:18:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:16,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:16,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:16,061 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:16,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 1 times [2019-01-11 11:18:16,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:16,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:16,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:16,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:16,556 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-01-11 11:18:16,706 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-11 11:18:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:16,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:16,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:16,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:16,715 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-11 11:18:16,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:16,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:16,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:16,719 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:16,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:16,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:16,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:16,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:16,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:16,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:16,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:18:16,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,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 21 treesize of output 24 [2019-01-11 11:18:16,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:18:16,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,829 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 26 treesize of output 40 [2019-01-11 11:18:16,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:18:16,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:18:16,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:18:16,853 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,894 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:16,973 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-11 11:18:16,973 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:18:16,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:16,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:18:17,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:17,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:17,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:17,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,125 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:17,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:18:17,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:17,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:17,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-11 11:18:17,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:17,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:18:17,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:17,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:17,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:50 [2019-01-11 11:18:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:17,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:17,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:17,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:18:17,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:17,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:17,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:18:17,512 INFO L87 Difference]: Start difference. First operand 188 states and 1135 transitions. Second operand 10 states. [2019-01-11 11:18:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:19,897 INFO L93 Difference]: Finished difference Result 250 states and 1266 transitions. [2019-01-11 11:18:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:18:19,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:19,901 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:18:19,901 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 11:18:19,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:18:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 11:18:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 188. [2019-01-11 11:18:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-11 11:18:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 1135 transitions. [2019-01-11 11:18:19,932 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 1135 transitions. Word has length 5 [2019-01-11 11:18:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:19,933 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 1135 transitions. [2019-01-11 11:18:19,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 1135 transitions. [2019-01-11 11:18:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:19,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:19,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:19,933 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash 29354206, now seen corresponding path program 1 times [2019-01-11 11:18:19,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:19,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:19,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:20,084 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2019-01-11 11:18:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:20,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:20,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:20,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:20,141 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-11 11:18:20,141 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:20,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:20,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:20,144 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:20,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:20,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:20,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:20,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:20,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:20,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:20,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:18:20,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:18:20,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:18:20,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:18:20,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:18:20,242 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:18:20,373 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,396 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-11 11:18:20,396 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-11 11:18:20,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:18:20,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:20,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:20,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,550 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:20,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 11:18:20,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:20,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-11 11:18:20,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:20,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 11:18:20,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:20,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:20,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:50 [2019-01-11 11:18:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:20,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:21,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:21,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:18:21,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:21,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:18:21,041 INFO L87 Difference]: Start difference. First operand 188 states and 1135 transitions. Second operand 10 states. [2019-01-11 11:18:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:24,372 INFO L93 Difference]: Finished difference Result 235 states and 1253 transitions. [2019-01-11 11:18:24,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:18:24,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:24,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:24,376 INFO L225 Difference]: With dead ends: 235 [2019-01-11 11:18:24,376 INFO L226 Difference]: Without dead ends: 233 [2019-01-11 11:18:24,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:18:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-11 11:18:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 199. [2019-01-11 11:18:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-11 11:18:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 1211 transitions. [2019-01-11 11:18:24,408 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 1211 transitions. Word has length 5 [2019-01-11 11:18:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:24,408 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 1211 transitions. [2019-01-11 11:18:24,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 1211 transitions. [2019-01-11 11:18:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:24,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:24,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:24,409 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash 29358486, now seen corresponding path program 1 times [2019-01-11 11:18:24,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:24,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:24,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:24,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:24,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:24,506 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [28], [29] [2019-01-11 11:18:24,506 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:24,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:24,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:24,510 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:18:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:24,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:24,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:24,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:24,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:24,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:24,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:24,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:24,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 11:18:24,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:18:24,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 11:18:24,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-11 11:18:24,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 11:18:24,581 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,649 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:24,682 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-11 11:18:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:18:24,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:24,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:24,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:24,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 11:18:24,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:24,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:24,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-11 11:18:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:24,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:24,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:24,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:18:24,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:24,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:18:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:18:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:18:24,975 INFO L87 Difference]: Start difference. First operand 199 states and 1211 transitions. Second operand 8 states. [2019-01-11 11:18:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:25,417 INFO L93 Difference]: Finished difference Result 223 states and 1233 transitions. [2019-01-11 11:18:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:18:25,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:18:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:25,420 INFO L225 Difference]: With dead ends: 223 [2019-01-11 11:18:25,420 INFO L226 Difference]: Without dead ends: 222 [2019-01-11 11:18:25,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-11 11:18:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2019-01-11 11:18:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-11 11:18:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 1211 transitions. [2019-01-11 11:18:25,454 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 1211 transitions. Word has length 5 [2019-01-11 11:18:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:25,454 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 1211 transitions. [2019-01-11 11:18:25,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:18:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 1211 transitions. [2019-01-11 11:18:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:25,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:25,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:25,455 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash 28933598, now seen corresponding path program 2 times [2019-01-11 11:18:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:25,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:25,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:25,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:25,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:25,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:25,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:18:25,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:18:25,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:25,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:25,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:18:25,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:18:25,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:18:25,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:18:25,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:25,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:25,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 11:18:25,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,665 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 26 treesize of output 40 [2019-01-11 11:18:25,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 11:18:25,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 11:18:25,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 11:18:25,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,761 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-11 11:18:25,830 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,853 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-11 11:18:25,854 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-11 11:18:25,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:25,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 11:18:25,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:25,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:25,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-11 11:18:26,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 11:18:26,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:26,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:26,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-11 11:18:26,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:26,135 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:26,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 11:18:26,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:26,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:26,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-11 11:18:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:26,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:26,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:26,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:18:26,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:26,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:18:26,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:18:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:26,339 INFO L87 Difference]: Start difference. First operand 199 states and 1211 transitions. Second operand 10 states. [2019-01-11 11:18:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:28,236 INFO L93 Difference]: Finished difference Result 284 states and 1495 transitions. [2019-01-11 11:18:28,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:18:28,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:18:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:28,241 INFO L225 Difference]: With dead ends: 284 [2019-01-11 11:18:28,241 INFO L226 Difference]: Without dead ends: 280 [2019-01-11 11:18:28,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:18:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-11 11:18:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 211. [2019-01-11 11:18:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-11 11:18:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 1290 transitions. [2019-01-11 11:18:28,276 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 1290 transitions. Word has length 5 [2019-01-11 11:18:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:28,276 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 1290 transitions. [2019-01-11 11:18:28,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:18:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 1290 transitions. [2019-01-11 11:18:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:18:28,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:28,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:18:28,278 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-11 11:18:28,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:28,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:18:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:28,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:28,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:28,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:28,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:18:28,391 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-11 11:18:28,392 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:28,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:28,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:28,395 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:18:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:28,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:28,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:28,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:28,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:28,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:28,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 11:18:28,494 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 24 treesize of output 30 [2019-01-11 11:18:28,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 11:18:28,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-11 11:18:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-11 11:18:28,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-11 11:18:28,531 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,561 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-11 11:18:28,643 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:28,666 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-11 11:18:28,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 11:18:28,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:28,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 11:18:28,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:43 [2019-01-11 11:18:28,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:28,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 105 [2019-01-11 11:18:28,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:18:29,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-11 11:18:29,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:206 [2019-01-11 11:18:44,996 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:18:44,997 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-11 11:18:45,004 INFO L168 Benchmark]: Toolchain (without parser) took 315776.62 ms. Allocated memory was 142.1 MB in the beginning and 208.1 MB in the end (delta: 66.1 MB). Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 179.0 kB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2019-01-11 11:18:45,004 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 142.1 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:18:45,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.61 ms. Allocated memory is still 142.1 MB. Free memory was 109.4 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:18:45,005 INFO L168 Benchmark]: Boogie Preprocessor took 24.06 ms. Allocated memory is still 142.1 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:18:45,005 INFO L168 Benchmark]: RCFGBuilder took 531.43 ms. Allocated memory is still 142.1 MB. Free memory was 105.9 MB in the beginning and 94.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-01-11 11:18:45,005 INFO L168 Benchmark]: TraceAbstraction took 315166.39 ms. Allocated memory was 142.1 MB in the beginning and 208.1 MB in the end (delta: 66.1 MB). Free memory was 93.8 MB in the beginning and 109.4 MB in the end (delta: -15.6 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-01-11 11:18:45,007 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.17 ms. Allocated memory is still 142.1 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.61 ms. Allocated memory is still 142.1 MB. Free memory was 109.4 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.06 ms. Allocated memory is still 142.1 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.43 ms. Allocated memory is still 142.1 MB. Free memory was 105.9 MB in the beginning and 94.0 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 315166.39 ms. Allocated memory was 142.1 MB in the beginning and 208.1 MB in the end (delta: 66.1 MB). Free memory was 93.8 MB in the beginning and 109.4 MB in the end (delta: -15.6 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...