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-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:37:30,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:37:30,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:37:30,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:37:30,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:37:30,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:37:30,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:37:30,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:37:30,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:37:30,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:37:30,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:37:30,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:37:30,669 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:37:30,670 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:37:30,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:37:30,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:37:30,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:37:30,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:37:30,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:37:30,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:37:30,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:37:30,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:37:30,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:37:30,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:37:30,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:37:30,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:37:30,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:37:30,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:37:30,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:37:30,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:37:30,707 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:37:30,708 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:37:30,708 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:37:30,709 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:37:30,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:37:30,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:37:30,710 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-18 09:37:30,723 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:37:30,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:37:30,724 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:37:30,724 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:37:30,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:37:30,724 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:37:30,725 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:37:30,725 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:37:30,725 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:37:30,725 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:37:30,725 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:37:30,726 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:37:30,726 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:37:30,726 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:37:30,727 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:37:30,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:37:30,727 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:37:30,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:37:30,728 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:37:30,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:37:30,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:37:30,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:37:30,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:37:30,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:37:30,729 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:37:30,729 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:37:30,729 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:37:30,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:37:30,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:37:30,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:37:30,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:37:30,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:37:30,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:37:30,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:37:30,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:37:30,731 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:37:30,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:37:30,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:37:30,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:37:30,732 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:37:30,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:37:30,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:37:30,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:37:30,789 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:37:30,790 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:37:30,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-02-18 09:37:30,791 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-02-18 09:37:30,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:37:30,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:37:30,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:37:30,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:37:30,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:37:30,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:37:30,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:37:30,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:37:30,898 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:37:30,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/1) ... [2019-02-18 09:37:30,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:37:30,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:37:30,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:37:30,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:37:30,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:37:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:37:30,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:37:31,326 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:37:31,327 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-18 09:37:31,328 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:37:31 BoogieIcfgContainer [2019-02-18 09:37:31,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:37:31,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:37:31,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:37:31,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:37:31,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:30" (1/2) ... [2019-02-18 09:37:31,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e18f2e1 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:37:31, skipping insertion in model container [2019-02-18 09:37:31,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:37:31" (2/2) ... [2019-02-18 09:37:31,340 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-02-18 09:37:31,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:37:31,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-18 09:37:31,377 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-18 09:37:31,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:37:31,412 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:37:31,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:37:31,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:37:31,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:37:31,413 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:37:31,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:37:31,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:37:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-18 09:37:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:37:31,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:31,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:37:31,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-18 09:37:31,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:31,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:31,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:31,618 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-18 09:37:31,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:37:31,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:37:31,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:31,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:37:31,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:37:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:37:31,645 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-18 09:37:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:31,825 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-18 09:37:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:31,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:37:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:31,841 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:37:31,841 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:37:31,844 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-18 09:37:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:37:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-18 09:37:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:37:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-18 09:37:31,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-18 09:37:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:31,879 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-18 09:37:31,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:37:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-18 09:37:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:37:31,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:31,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:37:31,881 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-18 09:37:31,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:31,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:31,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:31,958 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-18 09:37:31,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:37:31,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:37:31,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:31,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:37:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:37:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:37:31,962 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-18 09:37:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:32,121 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-18 09:37:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:32,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:37:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:32,122 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:37:32,122 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:37:32,124 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-18 09:37:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:37:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-18 09:37:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:37:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-18 09:37:32,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-18 09:37:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:32,128 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-18 09:37:32,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:37:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-18 09:37:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:37:32,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:32,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:37:32,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-18 09:37:32,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:32,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:32,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:32,244 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-18 09:37:32,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:32,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:32,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:37:32,250 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-18 09:37:32,308 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:32,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:32,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:32,376 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 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-18 09:37:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:32,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:32,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:32,383 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-18 09:37:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:32,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:32,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:32,475 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 12 treesize of output 15 [2019-02-18 09:37:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,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 15 treesize of output 21 [2019-02-18 09:37:32,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,508 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:32,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:32,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:32,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:32,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:32,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:32,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:32,842 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-02-18 09:37:32,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:32,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:33,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:33,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:33,048 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-18 09:37:33,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:33,069 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-18 09:37:33,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:37:33,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:37:33,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:33,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:37:33,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:37:33,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:37:33,089 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-02-18 09:37:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:33,145 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-02-18 09:37:33,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:37:33,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:37:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:33,147 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:37:33,147 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:37:33,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:37:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:37:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-02-18 09:37:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:37:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-02-18 09:37:33,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-02-18 09:37:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:33,153 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-02-18 09:37:33,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:37:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-02-18 09:37:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:37:33,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:33,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:37:33,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:33,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-18 09:37:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:33,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:33,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:33,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:33,318 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-18 09:37:33,330 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-18 09:37:33,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:33,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:33,331 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:37:33,331 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-18 09:37:33,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:33,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:33,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:33,341 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 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-18 09:37:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:33,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:33,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:33,342 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-18 09:37:33,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:33,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:33,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:33,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-18 09:37:33,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,383 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 15 treesize of output 21 [2019-02-18 09:37:33,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,405 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:33,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:33,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:33,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:33,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:33,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:33,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:33,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:37:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:33,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:33,665 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-18 09:37:33,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:33,687 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-18 09:37:33,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:33,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:37:33,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:33,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:37:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:37:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:33,709 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-02-18 09:37:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:34,225 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-02-18 09:37:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:37:34,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:37:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:34,226 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:37:34,226 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:37:34,227 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-18 09:37:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:37:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-02-18 09:37:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:37:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-02-18 09:37:34,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-02-18 09:37:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:34,233 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-02-18 09:37:34,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:37:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-02-18 09:37:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:34,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:34,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:34,234 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-02-18 09:37:34,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:34,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:34,269 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-18 09:37:34,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:37:34,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:37:34,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:34,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:37:34,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:37:34,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:37:34,272 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-02-18 09:37:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:34,325 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-02-18 09:37:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:34,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:37:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:34,326 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:37:34,326 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:37:34,327 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-18 09:37:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:37:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-18 09:37:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:37:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-02-18 09:37:34,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-02-18 09:37:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:34,332 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-02-18 09:37:34,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:37:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-18 09:37:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:34,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:34,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:34,333 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-02-18 09:37:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:34,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:34,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:34,440 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-18 09:37:34,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:34,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:34,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:34,441 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-02-18 09:37:34,523 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:34,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:34,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:34,538 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 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-18 09:37:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:34,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:34,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:34,539 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-18 09:37:34,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:34,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:34,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:34,574 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 12 treesize of output 15 [2019-02-18 09:37:34,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-18 09:37:34,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,598 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:34,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:34,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:34,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:34,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:34,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:34,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:34,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:34,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:34,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:34,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:34,732 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-18 09:37:34,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:34,761 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-18 09:37:34,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:34,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:37:34,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:34,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:37:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:37:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:34,782 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-02-18 09:37:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:34,962 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-02-18 09:37:34,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:37:34,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:37:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:34,964 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:37:34,964 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:37:34,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-18 09:37:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:37:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-02-18 09:37:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:37:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-02-18 09:37:34,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-02-18 09:37:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:34,970 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-02-18 09:37:34,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:37:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-02-18 09:37:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:34,971 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:34,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:34,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-18 09:37:34,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:34,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:34,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:34,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:34,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:35,080 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-18 09:37:35,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:35,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:35,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:35,081 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-18 09:37:35,084 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:35,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:35,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:35,091 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 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-18 09:37:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:35,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:35,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:35,092 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-18 09:37:35,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:35,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:35,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:35,111 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 12 treesize of output 15 [2019-02-18 09:37:35,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,117 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 15 treesize of output 21 [2019-02-18 09:37:35,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,134 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:35,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:35,198 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:35,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:35,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:35,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:35,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:37:35,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:35,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:35,417 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-18 09:37:35,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:35,469 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-18 09:37:35,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:35,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:35,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:35,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:35,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:35,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:35,489 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-02-18 09:37:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:35,723 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-02-18 09:37:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:35,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:37:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:35,725 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:37:35,725 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:37:35,726 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-18 09:37:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:37:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-02-18 09:37:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:37:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-02-18 09:37:35,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-02-18 09:37:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:35,733 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-02-18 09:37:35,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-02-18 09:37:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:35,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:35,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:35,734 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-02-18 09:37:35,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:35,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:35,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:35,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:35,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:35,772 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-18 09:37:35,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:35,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:35,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:35,773 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-02-18 09:37:35,774 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:35,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:35,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:35,780 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 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-18 09:37:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:35,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:35,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:35,781 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-18 09:37:35,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:35,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:35,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:35,808 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 12 treesize of output 15 [2019-02-18 09:37:35,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-18 09:37:35,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 09:37:35,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:35,908 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2019-02-18 09:37:35,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:35,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 09:37:35,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:35,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:35,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-18 09:37:35,970 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-18 09:37:35,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:35,982 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-18 09:37:36,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:37:36,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:37:36,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:36,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:37:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:37:36,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:37:36,003 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-02-18 09:37:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:36,056 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-02-18 09:37:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:37:36,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:37:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:36,058 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:37:36,058 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:37:36,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-18 09:37:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:37:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-02-18 09:37:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:37:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-02-18 09:37:36,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-02-18 09:37:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:36,068 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-02-18 09:37:36,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:37:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-02-18 09:37:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:36,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:36,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:36,070 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:36,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:36,070 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-18 09:37:36,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:36,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:36,190 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-18 09:37:36,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:36,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:36,191 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:36,192 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-18 09:37:36,194 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:36,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:36,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:36,199 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 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-18 09:37:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:36,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:36,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:36,200 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-18 09:37:36,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:36,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:36,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:36,224 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 12 treesize of output 15 [2019-02-18 09:37:36,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,232 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 15 treesize of output 21 [2019-02-18 09:37:36,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,238 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:36,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,297 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:36,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:37:36,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:36,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:36,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:37:36,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:36,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:37:36,444 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-18 09:37:36,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:36,608 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-18 09:37:36,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:36,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:36,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:36,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:36,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:36,628 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-02-18 09:37:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:36,814 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2019-02-18 09:37:36,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:37:36,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:37:36,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:36,816 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:37:36,817 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:37:36,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:37:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:37:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-02-18 09:37:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:37:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-18 09:37:36,827 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-18 09:37:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:36,827 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-18 09:37:36,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-18 09:37:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:36,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:36,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:36,829 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-02-18 09:37:36,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:36,908 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-18 09:37:36,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:36,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:36,909 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:36,909 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-02-18 09:37:36,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:36,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:36,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:36,915 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 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-18 09:37:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:36,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:36,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:36,916 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-18 09:37:36,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:36,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:36,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:36,965 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 12 treesize of output 15 [2019-02-18 09:37:36,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-18 09:37:36,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:36,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 09:37:36,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:36,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:37,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:37,001 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-02-18 09:37:37,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:37:37,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:37,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:37,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-18 09:37:37,076 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-18 09:37:37,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:37,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:37,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:37:37,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:37,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:37:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:37:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:37,116 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-02-18 09:37:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:37,208 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2019-02-18 09:37:37,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:37:37,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:37:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:37,213 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:37:37,213 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:37:37,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:37:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:37:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-02-18 09:37:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:37:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-18 09:37:37,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-18 09:37:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:37,222 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-18 09:37:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:37:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-18 09:37:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:37,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:37,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:37,224 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-02-18 09:37:37,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:37,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:37,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:37,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-18 09:37:37,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:37,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:37,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:37,280 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-02-18 09:37:37,281 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:37,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:37,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:37,287 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 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-18 09:37:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:37,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:37,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:37,287 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-18 09:37:37,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:37,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:37,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:37,308 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 12 treesize of output 15 [2019-02-18 09:37:37,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,344 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 15 treesize of output 21 [2019-02-18 09:37:37,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,410 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:37,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:37,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:37,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:37,570 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:37,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:37,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:37,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:37,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:37,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:37,738 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-18 09:37:37,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:37,753 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-18 09:37:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:37:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:37:37,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:37,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:37:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:37:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:37,773 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2019-02-18 09:37:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:37,872 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2019-02-18 09:37:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:37,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:37:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:37,874 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:37:37,874 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:37:37,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:37:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-18 09:37:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:37:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2019-02-18 09:37:37,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2019-02-18 09:37:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:37,885 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2019-02-18 09:37:37,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:37:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2019-02-18 09:37:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:37,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:37,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:37,886 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:37,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-02-18 09:37:37,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:37,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:37,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:37:38,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:38,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:38,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:38,009 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-02-18 09:37:38,011 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:38,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:38,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:38,016 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 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-18 09:37:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:38,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:38,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:38,017 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-18 09:37:38,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:38,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:38,040 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 12 treesize of output 15 [2019-02-18 09:37:38,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,048 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 15 treesize of output 21 [2019-02-18 09:37:38,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,055 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:38,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,104 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:38,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:38,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:38,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,216 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:38,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-18 09:37:38,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:38,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:38,259 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-18 09:37:38,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:38,419 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-18 09:37:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:38,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:38,442 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2019-02-18 09:37:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:38,624 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2019-02-18 09:37:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:37:38,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:37:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:38,626 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:37:38,626 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:37:38,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:37:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:37:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-02-18 09:37:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:37:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2019-02-18 09:37:38,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2019-02-18 09:37:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:38,636 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2019-02-18 09:37:38,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2019-02-18 09:37:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:38,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:38,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:38,637 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-02-18 09:37:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:38,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:38,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:38,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:38,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:38,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:38,727 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-02-18 09:37:38,729 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:38,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:38,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:38,733 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 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-18 09:37:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:38,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:38,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:38,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 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-18 09:37:38,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:38,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:38,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:38,756 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 12 treesize of output 15 [2019-02-18 09:37:38,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,768 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 15 treesize of output 21 [2019-02-18 09:37:38,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:38,787 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:38,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:38,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:37:38,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:38,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:38,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:38,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-02-18 09:37:38,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:38,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:38,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:37:38,967 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-18 09:37:38,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:38,986 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-18 09:37:39,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:39,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:39,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:39,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:39,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:39,007 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2019-02-18 09:37:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:39,413 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-02-18 09:37:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:39,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:37:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:39,417 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:37:39,417 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:37:39,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:37:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:37:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-18 09:37:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:37:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-02-18 09:37:39,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-02-18 09:37:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:39,428 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-02-18 09:37:39,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-02-18 09:37:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:39,428 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:39,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:39,429 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-02-18 09:37:39,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:39,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:39,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:39,508 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-18 09:37:39,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:39,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:39,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:39,509 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-02-18 09:37:39,511 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:39,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:39,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:39,515 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 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-18 09:37:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:39,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:39,516 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-18 09:37:39,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:39,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:39,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:39,539 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 12 treesize of output 15 [2019-02-18 09:37:39,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-18 09:37:39,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 09:37:39,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:39,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:39,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:39,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:39,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-02-18 09:37:39,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 09:37:39,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:39,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:39,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-18 09:37:39,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:39,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:37:39,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:39,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:39,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-18 09:37:39,681 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-18 09:37:39,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:39,702 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-18 09:37:39,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:39,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:39,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:39,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:39,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:39,722 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2019-02-18 09:37:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:39,976 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-02-18 09:37:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:39,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:37:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:39,977 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:37:39,977 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:37:39,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:37:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:37:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-18 09:37:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:37:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-02-18 09:37:39,992 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-02-18 09:37:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:39,993 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-02-18 09:37:39,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-02-18 09:37:39,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:39,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:39,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:39,994 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:39,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:39,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-02-18 09:37:39,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:39,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:39,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:39,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:39,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:40,166 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-02-18 09:37:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:40,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:40,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:40,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:40,235 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-18 09:37:40,238 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:40,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:40,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:40,245 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:37:40,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:40,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:40,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:40,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:40,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:40,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:40,289 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 12 treesize of output 15 [2019-02-18 09:37:40,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-18 09:37:40,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,333 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:40,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,374 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:37:40,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:40,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:40,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,474 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:40,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:37:40,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:40,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:40,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:40,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:37:40,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:40,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:40,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:40,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:37:40,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:40,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:37:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:37:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:37:40,643 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2019-02-18 09:37:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:41,065 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2019-02-18 09:37:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:37:41,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:37:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:41,066 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:37:41,066 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:37:41,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:37:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:37:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-02-18 09:37:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:37:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-18 09:37:41,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-02-18 09:37:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:41,077 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-18 09:37:41,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:37:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-18 09:37:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:37:41,077 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:41,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:37:41,078 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-02-18 09:37:41,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:41,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:37:41,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:41,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:41,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:37:41,214 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-02-18 09:37:41,217 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:41,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:41,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:41,221 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 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-18 09:37:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:41,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:41,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:41,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:41,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:41,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:41,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:41,275 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 12 treesize of output 15 [2019-02-18 09:37:41,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-18 09:37:41,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,316 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:41,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:41,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:41,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:41,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:41,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:37:41,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:41,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:41,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:41,456 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-18 09:37:41,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:41,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:41,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:41,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:41,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:41,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:41,477 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-02-18 09:37:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:41,625 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2019-02-18 09:37:41,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:37:41,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:37:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:41,626 INFO L225 Difference]: With dead ends: 29 [2019-02-18 09:37:41,627 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:37:41,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:37:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:37:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-02-18 09:37:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:37:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-02-18 09:37:41,636 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2019-02-18 09:37:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:41,637 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-02-18 09:37:41,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-02-18 09:37:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:37:41,637 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:41,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:37:41,638 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-02-18 09:37:41,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:41,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:41,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:41,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:41,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:37:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:41,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:41,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:37:41,789 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-02-18 09:37:41,790 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:41,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:41,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:41,795 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:37:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:41,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:41,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:41,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:41,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:41,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:41,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:41,814 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 12 treesize of output 15 [2019-02-18 09:37:41,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,818 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 15 treesize of output 21 [2019-02-18 09:37:41,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-18 09:37:41,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,862 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-02-18 09:37:41,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:41,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:41,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:41,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:41,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:37:42,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:42,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-18 09:37:42,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,070 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:42,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:37:42,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:42,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-18 09:37:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:42,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:42,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:37:42,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:42,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:37:42,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:37:42,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:37:42,169 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2019-02-18 09:37:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:42,395 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2019-02-18 09:37:42,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:37:42,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:37:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:42,397 INFO L225 Difference]: With dead ends: 27 [2019-02-18 09:37:42,397 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:37:42,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:37:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:37:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2019-02-18 09:37:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:37:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-02-18 09:37:42,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2019-02-18 09:37:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:42,404 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2019-02-18 09:37:42,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:37:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2019-02-18 09:37:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:37:42,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:42,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:37:42,405 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2019-02-18 09:37:42,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:42,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:42,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:42,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:42,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:37:42,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:42,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:42,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:37:42,505 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2019-02-18 09:37:42,506 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:42,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:42,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:42,511 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 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-18 09:37:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:42,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:42,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:42,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:42,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:42,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:42,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:42,529 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 12 treesize of output 15 [2019-02-18 09:37:42,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-18 09:37:42,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 09:37:42,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:42,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-02-18 09:37:42,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 09:37:42,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:42,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-18 09:37:42,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:42,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 09:37:42,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:42,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:42,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-18 09:37:42,711 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-18 09:37:42,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:42,723 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-18 09:37:42,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:42,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:37:42,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:42,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:37:42,744 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2019-02-18 09:37:43,199 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-02-18 09:37:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:43,450 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2019-02-18 09:37:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:43,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:37:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:43,451 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:37:43,451 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:37:43,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:37:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:37:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:37:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:37:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:37:43,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-18 09:37:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:43,453 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:37:43,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:37:43,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:37:43,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:37:43,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:37:43,644 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2019-02-18 09:37:44,442 WARN L181 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2019-02-18 09:37:44,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:37:44,445 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (let ((.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse0 (<= 0 .cse5)) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p2)) (.cse3 (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3)) (.cse4 (= 0 .cse2))) (or (and .cse0 (or (and (<= .cse1 0) (<= 1 .cse2)) (and (<= (+ .cse1 1) 0) .cse3 .cse4))) (and .cse0 (= 0 .cse1) .cse3 .cse4)))) [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-18 09:37:44,446 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-02-18 09:37:44,456 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:37:44 BoogieIcfgContainer [2019-02-18 09:37:44,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 09:37:44,457 INFO L168 Benchmark]: Toolchain (without parser) took 13620.31 ms. Allocated memory was 138.4 MB in the beginning and 334.5 MB in the end (delta: 196.1 MB). Free memory was 104.8 MB in the beginning and 145.9 MB in the end (delta: -41.2 MB). Peak memory consumption was 154.9 MB. Max. memory is 7.1 GB. [2019-02-18 09:37:44,457 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:37:44,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.43 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 102.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:37:44,458 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 101.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 09:37:44,458 INFO L168 Benchmark]: RCFGBuilder took 405.46 ms. Allocated memory is still 138.4 MB. Free memory was 101.2 MB in the beginning and 91.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-02-18 09:37:44,459 INFO L168 Benchmark]: TraceAbstraction took 13124.77 ms. Allocated memory was 138.4 MB in the beginning and 334.5 MB in the end (delta: 196.1 MB). Free memory was 91.1 MB in the beginning and 145.9 MB in the end (delta: -54.8 MB). Peak memory consumption was 141.3 MB. Max. memory is 7.1 GB. [2019-02-18 09:37:44,461 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.4 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.43 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 102.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.09 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 101.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.46 ms. Allocated memory is still 138.4 MB. Free memory was 101.2 MB in the beginning and 91.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13124.77 ms. Allocated memory was 138.4 MB in the beginning and 334.5 MB in the end (delta: 196.1 MB). Free memory was 91.1 MB in the beginning and 145.9 MB in the end (delta: -54.8 MB). Peak memory consumption was 141.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 <= #memory_int[p3] && ((#memory_int[p3 := #memory_int[p3] + 1][p2] <= 0 && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (((0 <= #memory_int[p3] && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 127 SDslu, 1 SDs, 0 SdLazy, 1173 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 15 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 100 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 4723 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 168 ConstructedInterpolants, 45 QuantifiedInterpolants, 9722 SizeOfPredicates, 30 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 25/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...