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-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:22:59,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:22:59,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:22:59,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:22:59,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:22:59,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:22:59,098 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:22:59,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:22:59,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:22:59,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:22:59,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:22:59,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:22:59,113 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:22:59,114 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:22:59,120 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:22:59,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:22:59,122 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:22:59,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:22:59,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:22:59,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:22:59,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:22:59,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:22:59,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:22:59,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:22:59,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:22:59,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:22:59,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:22:59,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:22:59,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:22:59,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:22:59,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:22:59,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:22:59,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:22:59,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:22:59,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:22:59,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:22:59,151 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:22:59,163 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:22:59,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:22:59,165 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:22:59,165 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:22:59,165 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:22:59,165 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:22:59,165 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:22:59,166 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:22:59,166 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:22:59,166 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:22:59,166 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:22:59,166 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:22:59,166 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:22:59,167 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:22:59,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:22:59,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:22:59,169 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:22:59,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:22:59,169 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:22:59,170 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:22:59,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:22:59,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:22:59,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:22:59,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:22:59,171 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:22:59,172 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:22:59,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:22:59,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:22:59,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:22:59,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:22:59,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:22:59,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:22:59,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:22:59,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:22:59,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:22:59,174 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:22:59,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:22:59,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:22:59,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:22:59,175 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:22:59,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:22:59,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:22:59,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:22:59,229 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:22:59,229 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:22:59,230 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-02-25 15:22:59,230 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-02-25 15:22:59,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:22:59,265 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:22:59,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:22:59,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:22:59,266 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:22:59,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:22:59,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:22:59,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:22:59,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:22:59,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... [2019-02-25 15:22:59,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:22:59,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:22:59,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:22:59,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:22:59,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:22:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:22:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:22:59,809 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:22:59,810 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-25 15:22:59,811 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:22:59 BoogieIcfgContainer [2019-02-25 15:22:59,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:22:59,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:22:59,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:22:59,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:22:59,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:59" (1/2) ... [2019-02-25 15:22:59,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ece7be3 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:22:59, skipping insertion in model container [2019-02-25 15:22:59,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:22:59" (2/2) ... [2019-02-25 15:22:59,819 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-02-25 15:22:59,829 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:22:59,837 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-25 15:22:59,853 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-25 15:22:59,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:22:59,887 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:22:59,887 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:22:59,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:22:59,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:22:59,888 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:22:59,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:22:59,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:22:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-25 15:22:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:22:59,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:59,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:22:59,914 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:59,921 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-25 15:22:59,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:59,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:00,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:00,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:23:00,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:23:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:23:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:00,174 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-25 15:23:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:00,434 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-25 15:23:00,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:00,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:23:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:00,451 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:23:00,451 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:23:00,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:23:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-25 15:23:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:23:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-25 15:23:00,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-25 15:23:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:00,489 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-25 15:23:00,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:23:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-25 15:23:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:00,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:00,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:00,491 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:00,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-25 15:23:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:00,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:00,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:00,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:00,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:23:00,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:00,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:23:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:23:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:00,555 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-25 15:23:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:00,819 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-25 15:23:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:00,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:23:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:00,821 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:23:00,821 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:23:00,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:23:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-25 15:23:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:23:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-25 15:23:00,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-25 15:23:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:00,827 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-25 15:23:00,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:23:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-25 15:23:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:00,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:00,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:00,829 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:00,829 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-25 15:23:00,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:00,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:01,093 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-25 15:23:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:01,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:01,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:01,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:01,133 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-25 15:23:01,169 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:01,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:01,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:01,246 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-02-25 15:23:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:01,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:01,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:01,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:01,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:01,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:01,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:01,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,530 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:23:01,530 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,545 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,550 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:23:01,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,670 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:01,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,727 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:01,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:01,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,790 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:01,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:01,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:01,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:23:01,889 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,150 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,484 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,571 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,635 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,663 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,679 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,715 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:02,716 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-02-25 15:23:02,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,816 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:02,817 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,984 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:02,984 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-25 15:23:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:04,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:04,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:04,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:04,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:04,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:04,228 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-25 15:23:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:24,192 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-25 15:23:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:24,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:24,194 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:23:24,194 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:23:24,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:23:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-25 15:23:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:23:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-25 15:23:24,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-25 15:23:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:24,202 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-25 15:23:24,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-25 15:23:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:24,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:24,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:24,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:24,203 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-25 15:23:24,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:24,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:24,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:24,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:24,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:24,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:24,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:24,295 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-25 15:23:24,297 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:24,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:24,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:24,308 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-02-25 15:23:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:24,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:24,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:24,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:24,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:24,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:24,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:24,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:24,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:23:24,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:24,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,367 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:24,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:24,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,413 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:24,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:24,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,515 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:23:24,516 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,611 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,647 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,676 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,706 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,740 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,760 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,834 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:23:24,835 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,838 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,839 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,870 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:24,871 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-02-25 15:23:24,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,986 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,016 INFO L292 Elim1Store]: Index analysis took 119 ms [2019-02-25 15:23:25,019 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:25,020 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,116 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:25,116 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-25 15:23:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:25,172 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:25,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:23:25,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-25 15:23:25,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:25,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:25,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:25,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:25,206 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-25 15:23:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:25,284 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-25 15:23:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:23:25,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:23:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:25,285 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:23:25,285 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:23:25,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:23:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-25 15:23:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:23:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-25 15:23:25,292 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-25 15:23:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:25,293 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-25 15:23:25,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-25 15:23:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:25,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:25,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:25,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-25 15:23:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:25,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:25,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:25,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:25,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:25,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:25,396 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-25 15:23:25,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:25,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:25,408 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:25,409 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-02-25 15:23:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:25,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:25,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:25,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:25,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:25,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:25,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:25,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:23:25,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,454 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:25,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,464 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:25,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,480 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:25,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:25,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,564 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,573 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:25,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,592 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:23:25,593 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,658 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,751 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,780 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,804 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,824 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,842 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:25,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:25,946 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,948 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,950 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,969 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,998 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:25,999 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-02-25 15:23:26,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:26,170 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,344 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:26,344 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-25 15:23:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:27,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:27,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:27,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:27,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:27,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:27,552 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-25 15:23:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:46,032 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-25 15:23:46,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:46,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:46,034 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:23:46,034 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:23:46,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:23:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-25 15:23:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:23:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-25 15:23:46,042 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-25 15:23:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:46,042 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-25 15:23:46,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-25 15:23:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:46,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:46,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:46,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-25 15:23:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:46,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:46,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:46,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:46,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:46,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:46,169 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-25 15:23:46,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:46,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:46,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:46,179 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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-02-25 15:23:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:46,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:46,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:46,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:46,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:46,218 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:46,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:46,229 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:23:46,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:46,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,243 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:46,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:46,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,278 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:46,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,370 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:46,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:23:46,411 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,683 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,718 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,749 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,769 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,790 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,808 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,892 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:46,893 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,895 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,897 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,899 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,927 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:46,928 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-02-25 15:23:46,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:46,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:23:46,999 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,085 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:47,085 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-25 15:23:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:48,248 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:48,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:48,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:48,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:48,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:48,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:48,300 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-25 15:24:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:06,688 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-25 15:24:06,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:06,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:24:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:06,691 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:24:06,692 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:24:06,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:24:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:24:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-25 15:24:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:24:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-25 15:24:06,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-25 15:24:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:06,708 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-25 15:24:06,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-25 15:24:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:06,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:06,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:06,711 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-25 15:24:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:06,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:06,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:06,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:24:06,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:24:06,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:24:06,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:24:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:24:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:24:06,778 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-02-25 15:24:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:06,841 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-02-25 15:24:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:24:06,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:24:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:06,842 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:24:06,842 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:24:06,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:24:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:24:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-02-25 15:24:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:24:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-02-25 15:24:06,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-02-25 15:24:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:06,849 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-02-25 15:24:06,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:24:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-02-25 15:24:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:06,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:06,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:06,850 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:06,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-25 15:24:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:06,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:06,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:06,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:06,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:06,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:06,920 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-25 15:24:06,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:06,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:06,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:06,933 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:24:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:06,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:06,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:06,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:06,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:06,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:24:06,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:06,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:06,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:06,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:06,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:06,971 INFO L467 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-02-25 15:24:06,972 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,975 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,992 INFO L467 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 24 treesize of output 27 [2019-02-25 15:24:07,000 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-25 15:24:07,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,014 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:24:07,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,031 INFO L467 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 31 treesize of output 45 [2019-02-25 15:24:07,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,046 INFO L467 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 33 treesize of output 59 [2019-02-25 15:24:07,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,059 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-25 15:24:07,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,082 INFO L467 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 37 treesize of output 100 [2019-02-25 15:24:07,083 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,128 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,153 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,173 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,188 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,203 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,215 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,243 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:07,244 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-02-25 15:24:07,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,343 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 104 [2019-02-25 15:24:07,345 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:07,519 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:07,519 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-02-25 15:24:09,107 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-02-25 15:24:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:09,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:24:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-25 15:24:09,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:24:09,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:24:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:24:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:09,183 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-02-25 15:24:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:09,239 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-02-25 15:24:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:24:09,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:24:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:09,241 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:24:09,241 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:24:09,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:24:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-02-25 15:24:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:24:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-02-25 15:24:09,249 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-02-25 15:24:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:09,250 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-02-25 15:24:09,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:24:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-02-25 15:24:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:09,251 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:09,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:09,251 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-25 15:24:09,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:09,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:09,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:09,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:09,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:09,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:09,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:09,358 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-25 15:24:09,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:09,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:09,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:09,366 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:24:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:09,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:09,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:09,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:09,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:09,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:09,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:09,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:24:09,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:09,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,403 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:09,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,416 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:09,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:09,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,448 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:09,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,477 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:09,478 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,538 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,572 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,597 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,620 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,635 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,657 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:24:09,764 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,768 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,769 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,798 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:09,799 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-25 15:24:09,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:09,860 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,946 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:09,947 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-25 15:24:09,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:09,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:10,027 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,111 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:10,112 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-25 15:24:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:12,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:12,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:12,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:12,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:12,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:12,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:12,444 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-02-25 15:24:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:48,708 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2019-02-25 15:24:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:48,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:48,710 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:24:48,710 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:24:48,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:24:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-02-25 15:24:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:24:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-02-25 15:24:48,720 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-02-25 15:24:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:48,720 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-02-25 15:24:48,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-02-25 15:24:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:48,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:48,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:48,721 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-25 15:24:48,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:48,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:48,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:48,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:48,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:48,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:48,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:48,808 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-25 15:24:48,809 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:48,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:48,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:48,815 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:24:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:48,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:48,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:48,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:48,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:48,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:48,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:48,844 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:24:48,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,849 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:48,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:48,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,871 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:48,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,933 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:48,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,944 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:48,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:48,957 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,037 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,077 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,105 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,128 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,147 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,164 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:49,234 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,235 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,236 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,238 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,266 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:49,266 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:85, output treesize:54 [2019-02-25 15:24:49,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:49,325 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,422 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:49,422 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-25 15:24:49,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,657 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:49,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:49,659 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,765 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:49,765 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-25 15:24:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:52,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:52,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:52,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:52,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:52,188 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-02-25 15:25:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:29,417 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-02-25 15:25:29,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:25:29,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:25:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:29,419 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:25:29,419 INFO L226 Difference]: Without dead ends: 70 [2019-02-25 15:25:29,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:29,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-25 15:25:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-02-25 15:25:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:25:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-02-25 15:25:29,431 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-02-25 15:25:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:29,431 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-02-25 15:25:29,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-02-25 15:25:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:25:29,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:29,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:25:29,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-25 15:25:29,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:29,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:29,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:29,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:29,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:29,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:29,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:29,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:25:29,520 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-25 15:25:29,521 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:29,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:29,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:29,528 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:25:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:29,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:29,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:29,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:29,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:29,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:29,572 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:25:29,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:29,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:29,614 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,615 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,617 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,619 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,637 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:25:29,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:29,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,645 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:29,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,655 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:29,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:29,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:29,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,743 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:29,744 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,802 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,834 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,858 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,879 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,896 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,912 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,944 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,944 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2019-02-25 15:25:29,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:30,009 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:30,097 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:30,097 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-25 15:25:30,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,183 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:30,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:30,186 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:30,265 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:30,266 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-25 15:25:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:32,780 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:32,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:32,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:25:32,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:32,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:32,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:25:32,823 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-02-25 15:26:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:08,102 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-02-25 15:26:08,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:26:08,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:26:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:08,104 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:26:08,104 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:26:08,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:26:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-02-25 15:26:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:26:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 138 transitions. [2019-02-25 15:26:08,113 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 138 transitions. Word has length 4 [2019-02-25 15:26:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:08,113 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 138 transitions. [2019-02-25 15:26:08,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 138 transitions. [2019-02-25 15:26:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:26:08,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:08,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:26:08,115 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-25 15:26:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:08,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:08,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:08,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:08,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:08,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:26:08,228 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-25 15:26:08,229 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:08,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:08,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:08,235 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:26:08,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:08,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:08,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:08,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:08,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:08,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:08,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:08,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:08,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:26:08,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,266 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:08,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,277 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:08,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,285 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:08,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,300 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:08,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,311 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:08,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:08,358 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,543 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,574 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,602 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,621 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,636 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,653 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,714 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:26:08,714 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,716 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,718 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,746 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:08,747 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-25 15:26:08,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:08,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:08,804 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:08,893 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:08,894 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-25 15:26:09,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,157 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:09,158 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,242 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:09,242 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-25 15:26:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:11,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:11,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:11,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:26:11,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:11,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:26:11,599 INFO L87 Difference]: Start difference. First operand 37 states and 138 transitions. Second operand 8 states. [2019-02-25 15:26:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:46,418 INFO L93 Difference]: Finished difference Result 74 states and 200 transitions. [2019-02-25 15:26:46,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:26:46,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:26:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:46,419 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:26:46,420 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:26:46,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:26:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-02-25 15:26:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:26:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2019-02-25 15:26:46,428 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 4 [2019-02-25 15:26:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:46,428 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 155 transitions. [2019-02-25 15:26:46,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 155 transitions. [2019-02-25 15:26:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:26:46,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:46,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:26:46,429 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 941284, now seen corresponding path program 1 times [2019-02-25 15:26:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:46,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:46,605 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-25 15:26:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:46,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:46,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:26:46,633 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [31] [2019-02-25 15:26:46,634 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:46,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:46,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:46,640 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:26:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:46,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:46,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:46,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:46,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:46,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:46,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:46,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:46,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,685 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:26:46,685 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,688 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,689 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:26:46,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,713 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:46,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:46,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,725 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:46,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,734 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:46,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,742 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:46,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:46,754 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,811 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,843 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,867 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,885 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,901 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,915 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:46,943 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:46,943 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-25 15:26:46,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:46,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:46,998 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,086 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:47,087 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-25 15:26:47,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:47,179 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,284 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:47,284 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-25 15:26:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:49,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:49,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:49,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:26:49,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:49,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:49,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:26:49,614 INFO L87 Difference]: Start difference. First operand 35 states and 155 transitions. Second operand 8 states. [2019-02-25 15:27:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:02,945 INFO L93 Difference]: Finished difference Result 67 states and 213 transitions. [2019-02-25 15:27:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:27:02,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:27:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:02,947 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:27:02,947 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:27:02,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:27:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-02-25 15:27:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:27:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2019-02-25 15:27:02,956 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 178 transitions. Word has length 4 [2019-02-25 15:27:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:02,957 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 178 transitions. [2019-02-25 15:27:02,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:27:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 178 transitions. [2019-02-25 15:27:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:27:02,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:02,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:27:02,958 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-25 15:27:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:02,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:02,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:03,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:03,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:03,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:27:03,044 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [33] [2019-02-25 15:27:03,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:03,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:03,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:03,051 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-02-25 15:27:03,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:03,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:03,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:03,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:03,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:03,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:03,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:27:03,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:03,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:27:03,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,078 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:27:03,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2019-02-25 15:27:03,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,096 INFO L467 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 31 treesize of output 49 [2019-02-25 15:27:03,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,114 INFO L467 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 33 treesize of output 63 [2019-02-25 15:27:03,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,128 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 85 [2019-02-25 15:27:03,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 104 [2019-02-25 15:27:03,157 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,202 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,230 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,253 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,270 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,287 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,301 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:27:03,353 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,358 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,363 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:03,392 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:03,392 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:68, output treesize:59 [2019-02-25 15:27:03,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:03,529 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:27:03,534 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:27:03,893 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 26 dim-0 vars, and 5 xjuncts. [2019-02-25 15:27:03,893 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:236 [2019-02-25 15:27:08,566 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:27:08,767 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:08,769 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) 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:292) 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-02-25 15:27:08,777 INFO L168 Benchmark]: Toolchain (without parser) took 249513.44 ms. Allocated memory was 133.2 MB in the beginning and 306.2 MB in the end (delta: 173.0 MB). Free memory was 108.4 MB in the beginning and 112.1 MB in the end (delta: -3.7 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:08,778 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.2 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:27:08,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.46 ms. Allocated memory is still 133.2 MB. Free memory was 108.0 MB in the beginning and 105.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:08,779 INFO L168 Benchmark]: Boogie Preprocessor took 25.49 ms. Allocated memory is still 133.2 MB. Free memory was 105.9 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:08,779 INFO L168 Benchmark]: RCFGBuilder took 462.42 ms. Allocated memory is still 133.2 MB. Free memory was 104.6 MB in the beginning and 91.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:08,779 INFO L168 Benchmark]: TraceAbstraction took 248962.63 ms. Allocated memory was 133.2 MB in the beginning and 306.2 MB in the end (delta: 173.0 MB). Free memory was 91.9 MB in the beginning and 112.1 MB in the end (delta: -20.2 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:08,782 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 133.2 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.46 ms. Allocated memory is still 133.2 MB. Free memory was 108.0 MB in the beginning and 105.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.49 ms. Allocated memory is still 133.2 MB. Free memory was 105.9 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 462.42 ms. Allocated memory is still 133.2 MB. Free memory was 104.6 MB in the beginning and 91.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248962.63 ms. Allocated memory was 133.2 MB in the beginning and 306.2 MB in the end (delta: 173.0 MB). Free memory was 91.9 MB in the beginning and 112.1 MB in the end (delta: -20.2 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...