java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:56:58,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:56:58,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:56:58,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:56:58,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:56:58,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:56:58,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:56:58,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:56:58,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:56:58,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:56:58,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:56:58,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:56:58,176 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:56:58,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:56:58,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:56:58,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:56:58,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:56:58,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:56:58,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:56:58,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:56:58,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:56:58,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:56:58,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:56:58,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:56:58,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:56:58,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:56:58,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:56:58,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:56:58,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:56:58,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:56:58,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:56:58,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:56:58,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:56:58,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:56:58,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:56:58,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:56:58,199 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-15 10:56:58,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:56:58,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:56:58,213 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:56:58,213 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:56:58,213 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:56:58,213 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:56:58,214 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:56:58,214 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:56:58,214 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:56:58,214 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:56:58,214 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:56:58,215 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:56:58,215 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:56:58,215 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:56:58,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:56:58,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:56:58,216 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:56:58,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:56:58,216 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:56:58,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:56:58,217 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:56:58,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:56:58,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:56:58,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:56:58,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:56:58,218 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:56:58,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:56:58,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:56:58,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:56:58,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:56:58,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:56:58,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:56:58,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:56:58,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:56:58,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:56:58,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:56:58,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:56:58,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:56:58,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:56:58,220 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:56:58,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:56:58,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:56:58,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:56:58,279 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:56:58,280 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:56:58,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-02-15 10:56:58,281 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-02-15 10:56:58,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:56:58,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:56:58,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:56:58,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:56:58,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:56:58,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:56:58,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:56:58,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:56:58,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:56:58,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/1) ... [2019-02-15 10:56:58,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:56:58,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:56:58,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:56:58,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:56:58,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (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-15 10:56:58,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:56:58,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:56:58,895 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:56:58,895 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-15 10:56:58,896 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:56:58 BoogieIcfgContainer [2019-02-15 10:56:58,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:56:58,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:56:58,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:56:58,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:56:58,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:56:58" (1/2) ... [2019-02-15 10:56:58,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452eea75 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:56:58, skipping insertion in model container [2019-02-15 10:56:58,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:56:58" (2/2) ... [2019-02-15 10:56:58,917 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-02-15 10:56:58,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:56:58,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-15 10:56:58,951 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-15 10:56:58,987 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:56:58,988 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:56:58,988 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:56:58,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:56:58,988 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:56:58,989 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:56:58,989 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:56:58,989 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:56:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-15 10:56:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:56:59,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:59,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:56:59,014 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-15 10:56:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:59,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:59,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:59,183 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-15 10:56:59,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:56:59,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:56:59,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:59,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:56:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:56:59,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:56:59,207 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-15 10:56:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:59,425 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-15 10:56:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:56:59,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:56:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:59,441 INFO L225 Difference]: With dead ends: 29 [2019-02-15 10:56:59,441 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 10:56:59,444 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-15 10:56:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 10:56:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-15 10:56:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 10:56:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-15 10:56:59,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-15 10:56:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:59,477 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-15 10:56:59,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:56:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-15 10:56:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:56:59,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:59,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:56:59,479 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-15 10:56:59,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:59,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:59,646 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 10:56:59,657 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-15 10:56:59,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:59,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:59,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:56:59,660 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-15 10:56:59,698 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:56:59,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:56:59,769 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:56:59,770 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:56:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:59,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:56:59,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:59,777 INFO 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-15 10:56:59,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:59,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:59,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:00,196 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-02-15 10:57:00,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:00,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:00,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:00,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:00,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:00,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:00,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:00,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:00,588 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,793 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:00,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:01,007 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:01,178 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-02-15 10:57:01,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:01,397 INFO L303 Elim1Store]: Index analysis took 204 ms [2019-02-15 10:57:01,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:01,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:01,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:01,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:01,633 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-15 10:57:01,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:01,649 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-15 10:57:01,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:01,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:01,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:01,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:01,672 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-15 10:57:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:03,510 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-15 10:57:03,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:03,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:03,511 INFO L225 Difference]: With dead ends: 47 [2019-02-15 10:57:03,511 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 10:57:03,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 10:57:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-15 10:57:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:57:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-15 10:57:03,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-15 10:57:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:03,520 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-15 10:57:03,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-15 10:57:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:03,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:03,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:03,521 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-15 10:57:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:03,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:03,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:03,594 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-15 10:57:03,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:03,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:03,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:03,595 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-15 10:57:03,598 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:03,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:03,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:03,614 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:03,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:03,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:03,615 INFO 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-15 10:57:03,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:03,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:03,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:03,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:03,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:03,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:03,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:03,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:03,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:03,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:03,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,876 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:03,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:04,050 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:04,079 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:04,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:04,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:04,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:04,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-15 10:57:04,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:04,285 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-15 10:57:04,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:57:04,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:04,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:04,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:04,304 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-15 10:57:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:04,380 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-15 10:57:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:04,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:57:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:04,381 INFO L225 Difference]: With dead ends: 23 [2019-02-15 10:57:04,382 INFO L226 Difference]: Without dead ends: 22 [2019-02-15 10:57:04,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-15 10:57:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-15 10:57:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 10:57:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-15 10:57:04,389 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-15 10:57:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:04,389 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-15 10:57:04,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-15 10:57:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:04,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:04,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:04,391 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-15 10:57:04,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:04,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:04,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:04,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:04,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:04,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:04,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:04,479 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-15 10:57:04,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:04,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:04,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:04,492 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:04,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:04,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:04,493 INFO 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-15 10:57:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:04,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:04,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:04,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:04,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:04,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:04,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:04,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:04,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:04,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:04,912 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-02-15 10:57:04,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:04,914 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,017 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,148 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:05,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:05,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:05,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:05,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:05,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:05,350 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-15 10:57:05,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:05,361 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-15 10:57:05,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:05,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:05,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:05,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:05,380 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-15 10:57:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:06,830 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-02-15 10:57:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:06,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:06,832 INFO L225 Difference]: With dead ends: 50 [2019-02-15 10:57:06,832 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:57:06,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:57:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-02-15 10:57:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 10:57:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-02-15 10:57:06,840 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-02-15 10:57:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:06,840 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-02-15 10:57:06,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-02-15 10:57:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:06,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:06,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:06,841 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-15 10:57:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:06,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:06,923 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-15 10:57:06,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:06,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:06,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:06,924 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-15 10:57:06,927 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:06,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:06,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:06,936 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:06,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:06,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:06,936 INFO 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-15 10:57:06,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:06,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:06,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:07,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:07,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:07,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:07,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:07,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:07,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:07,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,167 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,205 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:07,325 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:07,348 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:07,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:07,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:07,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:07,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:07,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:07,594 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-15 10:57:07,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:07,623 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-15 10:57:07,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:07,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:07,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:07,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:07,644 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-02-15 10:57:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:08,653 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-02-15 10:57:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:08,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:08,654 INFO L225 Difference]: With dead ends: 50 [2019-02-15 10:57:08,654 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 10:57:08,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 10:57:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-15 10:57:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:57:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-02-15 10:57:08,662 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-02-15 10:57:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:08,662 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-02-15 10:57:08,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-02-15 10:57:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:08,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:08,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:08,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-15 10:57:08,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:08,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:08,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:08,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:08,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:08,823 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-15 10:57:08,824 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:08,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:08,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:08,831 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:08,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:08,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:08,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:08,832 INFO 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-15 10:57:08,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:08,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:08,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:08,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:08,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:08,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:08,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:08,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:08,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:09,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:09,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,050 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:09,149 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:09,172 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:09,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:09,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:09,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:09,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:09,677 INFO L303 Elim1Store]: Index analysis took 366 ms [2019-02-15 10:57:09,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-15 10:57:09,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:09,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:09,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-02-15 10:57:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:09,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:10,020 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-15 10:57:10,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:10,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:10,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:10,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:10,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:10,041 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-02-15 10:57:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:12,850 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-02-15 10:57:12,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:12,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:12,851 INFO L225 Difference]: With dead ends: 62 [2019-02-15 10:57:12,852 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 10:57:12,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 10:57:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-02-15 10:57:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:57:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-02-15 10:57:12,861 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-02-15 10:57:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:12,861 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-02-15 10:57:12,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-02-15 10:57:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:12,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:12,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:12,862 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-15 10:57:12,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:12,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:12,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:12,957 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-15 10:57:12,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:12,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:12,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:12,957 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-15 10:57:12,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:12,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:12,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:12,966 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:12,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:12,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:12,967 INFO 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-15 10:57:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:12,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:12,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:13,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:13,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:13,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:13,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:13,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:13,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:13,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,204 INFO L303 Elim1Store]: Index analysis took 135 ms [2019-02-15 10:57:13,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:13,206 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,275 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:13,343 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:13,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:13,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:13,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:13,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:13,501 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:13,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 10:57:13,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:13,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:13,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-02-15 10:57:13,781 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-15 10:57:13,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:13,851 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-15 10:57:13,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:13,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:13,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:13,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:13,872 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-02-15 10:57:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:16,611 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-02-15 10:57:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:16,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:16,612 INFO L225 Difference]: With dead ends: 60 [2019-02-15 10:57:16,612 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:57:16,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:57:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-02-15 10:57:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:57:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-15 10:57:16,621 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-15 10:57:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:16,621 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-15 10:57:16,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-15 10:57:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:16,622 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:16,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:16,623 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-15 10:57:16,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:16,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:16,724 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-15 10:57:16,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:16,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:16,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:16,725 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-15 10:57:16,727 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:16,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:16,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:16,733 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:16,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:16,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:16,734 INFO 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-15 10:57:16,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:16,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:16,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:16,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:16,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:16,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:16,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:16,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:16,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:16,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,928 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:17,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:17,058 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:17,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:17,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:17,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:17,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:17,244 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:17,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-02-15 10:57:17,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:17,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:17,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-02-15 10:57:17,472 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-15 10:57:17,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:17,495 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-15 10:57:17,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:17,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:17,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:17,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:17,515 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-02-15 10:57:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:20,218 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-02-15 10:57:20,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:20,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:20,220 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:57:20,220 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:57:20,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:57:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-15 10:57:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:57:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-02-15 10:57:20,228 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-02-15 10:57:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:20,228 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-02-15 10:57:20,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-02-15 10:57:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:20,229 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:20,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:20,230 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-02-15 10:57:20,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:20,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:20,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:20,366 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-15 10:57:20,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:20,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:20,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:20,367 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-02-15 10:57:20,368 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:20,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:20,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:20,375 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:20,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:20,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:20,376 INFO 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-15 10:57:20,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:20,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:20,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:20,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:20,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:20,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:20,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:20,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:20,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:20,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:20,529 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,675 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,696 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,760 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:20,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:20,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:20,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:20,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:20,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:20,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-15 10:57:20,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:21,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:21,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-02-15 10:57:21,165 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-15 10:57:21,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:21,190 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-15 10:57:21,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:21,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:21,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:21,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:21,209 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-02-15 10:57:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:23,183 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-02-15 10:57:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:23,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:23,186 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:57:23,186 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:57:23,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:57:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-02-15 10:57:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:57:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-02-15 10:57:23,195 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-02-15 10:57:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:23,195 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-02-15 10:57:23,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-02-15 10:57:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:23,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:23,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:23,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-02-15 10:57:23,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:23,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:23,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:23,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:23,301 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-15 10:57:23,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:23,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:23,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:23,301 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-15 10:57:23,302 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:23,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:23,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:23,308 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:23,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:23,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:23,308 INFO 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-15 10:57:23,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:23,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:23,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:23,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:23,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:23,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:23,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:23,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:23,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:23,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:23,485 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,531 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,570 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:23,621 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:23,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:23,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:23,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:23,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:23,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-15 10:57:23,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:23,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:23,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:23,981 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-15 10:57:23,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:24,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:24,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:24,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:24,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:24,044 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-02-15 10:57:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:25,721 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-02-15 10:57:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:57:25,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:25,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:25,723 INFO L225 Difference]: With dead ends: 77 [2019-02-15 10:57:25,724 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 10:57:25,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 10:57:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-02-15 10:57:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:57:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-02-15 10:57:25,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-02-15 10:57:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:25,735 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-02-15 10:57:25,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-02-15 10:57:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:25,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:25,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:25,736 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-02-15 10:57:25,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:25,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:25,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:25,812 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-15 10:57:25,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:25,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:25,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:25,813 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-02-15 10:57:25,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:25,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:25,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:25,820 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:25,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:25,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:25,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:57:25,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:25,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:25,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:25,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:25,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:25,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 10:57:25,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 10:57:25,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 10:57:25,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:25,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 10:57:25,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,001 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:26,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,117 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-15 10:57:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-02-15 10:57:26,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:26,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:26,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-15 10:57:26,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:26,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:26,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-15 10:57:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:26,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:26,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:26,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:26,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:26,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:26,962 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-02-15 10:57:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:28,623 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-02-15 10:57:28,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:28,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:28,626 INFO L225 Difference]: With dead ends: 82 [2019-02-15 10:57:28,626 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 10:57:28,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 10:57:28,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-02-15 10:57:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 10:57:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-02-15 10:57:28,637 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-02-15 10:57:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:28,637 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-02-15 10:57:28,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-02-15 10:57:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:28,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:28,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:28,638 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:28,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:28,639 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-02-15 10:57:28,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:28,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:28,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:28,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:28,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:28,707 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-15 10:57:28,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:28,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:28,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:28,708 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-02-15 10:57:28,709 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:28,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:28,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:28,717 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:28,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:28,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:28,718 INFO 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-15 10:57:28,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:28,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:28,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:28,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:57:28,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:28,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-15 10:57:28,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-15 10:57:28,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-02-15 10:57:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-02-15 10:57:28,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:28,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-02-15 10:57:28,827 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,878 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,893 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:28,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:28,942 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-02-15 10:57:30,997 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 29 [2019-02-15 10:57:31,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 10:57:31,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:57:31,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-02-15 10:57:31,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-02-15 10:57:45,949 WARN L181 SmtUtils]: Spent 14.35 s on a formula simplification that was a NOOP. DAG size: 106 [2019-02-15 10:57:45,959 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-15 10:57:45,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:46,067 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-15 10:57:46,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:46,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:46,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:46,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:46,088 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-02-15 10:58:13,075 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 10:58:13,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:58:13,076 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:191) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-02-15 10:58:13,080 INFO L168 Benchmark]: Toolchain (without parser) took 74743.23 ms. Allocated memory was 139.5 MB in the beginning and 354.4 MB in the end (delta: 215.0 MB). Free memory was 104.2 MB in the beginning and 136.7 MB in the end (delta: -32.6 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:13,081 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 105.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:58:13,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.21 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 102.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:13,082 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 ms. Allocated memory is still 139.5 MB. Free memory was 102.1 MB in the beginning and 100.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:13,082 INFO L168 Benchmark]: RCFGBuilder took 473.27 ms. Allocated memory is still 139.5 MB. Free memory was 100.8 MB in the beginning and 88.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:13,083 INFO L168 Benchmark]: TraceAbstraction took 74181.94 ms. Allocated memory was 139.5 MB in the beginning and 354.4 MB in the end (delta: 215.0 MB). Free memory was 88.5 MB in the beginning and 136.7 MB in the end (delta: -48.2 MB). Peak memory consumption was 166.7 MB. Max. memory is 7.1 GB. [2019-02-15 10:58:13,085 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 105.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.21 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 102.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.24 ms. Allocated memory is still 139.5 MB. Free memory was 102.1 MB in the beginning and 100.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 473.27 ms. Allocated memory is still 139.5 MB. Free memory was 100.8 MB in the beginning and 88.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74181.94 ms. Allocated memory was 139.5 MB in the beginning and 354.4 MB in the end (delta: 215.0 MB). Free memory was 88.5 MB in the beginning and 136.7 MB in the end (delta: -48.2 MB). Peak memory consumption was 166.7 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...