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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:49:15,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:49:15,613 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:49:15,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:49:15,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:49:15,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:49:15,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:49:15,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:49:15,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:49:15,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:49:15,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:49:15,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:49:15,634 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:49:15,635 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:49:15,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:49:15,637 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:49:15,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:49:15,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:49:15,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:49:15,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:49:15,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:49:15,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:49:15,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:49:15,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:49:15,650 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:49:15,651 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:49:15,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:49:15,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:49:15,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:49:15,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:49:15,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:49:15,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:49:15,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:49:15,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:49:15,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:49:15,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:49:15,659 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:49:15,672 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:49:15,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:49:15,674 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:49:15,674 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:49:15,674 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:49:15,674 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:49:15,675 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:49:15,675 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:49:15,675 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:49:15,675 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:49:15,675 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:49:15,676 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:49:15,676 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:49:15,676 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:49:15,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:49:15,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:49:15,677 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:49:15,677 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:49:15,678 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:49:15,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:49:15,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:49:15,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:49:15,678 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:49:15,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:49:15,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:49:15,679 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:49:15,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:49:15,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:49:15,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:49:15,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:49:15,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:49:15,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:49:15,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:49:15,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:49:15,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:49:15,681 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:49:15,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:49:15,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:49:15,682 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:49:15,682 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:49:15,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:49:15,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:49:15,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:49:15,748 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:49:15,749 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:49:15,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-02-15 10:49:15,750 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-02-15 10:49:15,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:49:15,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:49:15,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:49:15,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:49:15,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:49:15,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:49:15,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:49:15,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:49:15,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:49:15,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... [2019-02-15 10:49:15,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:49:15,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:49:15,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:49:15,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:49:15,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:49:15,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:49:15,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:49:16,181 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:49:16,182 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-15 10:49:16,183 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:16 BoogieIcfgContainer [2019-02-15 10:49:16,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:49:16,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:49:16,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:49:16,187 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:49:16,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:49:15" (1/2) ... [2019-02-15 10:49:16,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef717ae and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:16, skipping insertion in model container [2019-02-15 10:49:16,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:16" (2/2) ... [2019-02-15 10:49:16,191 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-02-15 10:49:16,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:49:16,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-15 10:49:16,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-15 10:49:16,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:49:16,256 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:49:16,256 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:49:16,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:49:16,256 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:49:16,257 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:49:16,257 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:49:16,257 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:49:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-15 10:49:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:49:16,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:16,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:49:16,281 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-15 10:49:16,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:16,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:16,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:16,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:16,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:49:16,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:49:16,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:16,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:49:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:49:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:16,499 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-15 10:49:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:16,702 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-15 10:49:16,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:16,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:49:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:16,721 INFO L225 Difference]: With dead ends: 17 [2019-02-15 10:49:16,722 INFO L226 Difference]: Without dead ends: 12 [2019-02-15 10:49:16,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-15 10:49:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-15 10:49:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 10:49:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-15 10:49:16,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-15 10:49:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:16,761 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-15 10:49:16,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:49:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-15 10:49:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:16,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:16,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:16,762 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-15 10:49:16,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:16,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:16,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:16,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:16,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:49:16,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:49:16,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:16,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:49:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:49:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:16,804 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-15 10:49:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:16,892 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-15 10:49:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:16,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:49:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:16,894 INFO L225 Difference]: With dead ends: 12 [2019-02-15 10:49:16,894 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 10:49:16,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 10:49:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-15 10:49:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 10:49:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-15 10:49:16,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-15 10:49:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:16,899 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-15 10:49:16,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:49:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-15 10:49:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:16,900 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:16,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:16,900 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-15 10:49:16,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:16,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:16,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:16,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:16,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:16,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:16,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:49:16,973 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-15 10:49:17,008 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:17,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:17,081 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:17,082 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:49:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:17,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:17,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:17,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:17,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:17,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:17,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:17,372 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-15 10:49:17,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:17,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:17,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:17,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:17,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:17,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:17,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-15 10:49:17,616 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-15 10:49:17,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:17,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:17,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:17,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:17,749 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:17,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:17,798 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-15 10:49:17,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:17,831 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-15 10:49:17,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:17,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:17,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:49:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:49:17,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:17,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:49:17,956 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-02-15 10:49:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:18,059 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-02-15 10:49:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:49:18,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:49:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:18,061 INFO L225 Difference]: With dead ends: 13 [2019-02-15 10:49:18,061 INFO L226 Difference]: Without dead ends: 12 [2019-02-15 10:49:18,062 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-15 10:49:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-15 10:49:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-02-15 10:49:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 10:49:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-02-15 10:49:18,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-02-15 10:49:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:18,068 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-02-15 10:49:18,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-02-15 10:49:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:49:18,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:18,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:49:18,069 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-15 10:49:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:18,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:18,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:18,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:49:18,118 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-15 10:49:18,120 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:18,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:18,127 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:18,127 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:49:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:18,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:18,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:18,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:18,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:18,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:18,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:18,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:18,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:18,302 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-15 10:49:18,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:18,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:18,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:18,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:18,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-15 10:49:18,369 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-15 10:49:18,370 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,425 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:18,452 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:18,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:18,570 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-15 10:49:18,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,769 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-15 10:49:18,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:18,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:18,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:18,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:18,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:18,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:18,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:18,897 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-02-15 10:49:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:19,148 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-02-15 10:49:19,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:19,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:49:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:19,149 INFO L225 Difference]: With dead ends: 24 [2019-02-15 10:49:19,149 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 10:49:19,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:49:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 10:49:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-02-15 10:49:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:49:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-02-15 10:49:19,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-02-15 10:49:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:19,155 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-02-15 10:49:19,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-02-15 10:49:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:19,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:19,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:19,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-02-15 10:49:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:19,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:19,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:19,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:49:19,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:49:19,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:19,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:49:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:49:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:19,202 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-02-15 10:49:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:19,240 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-02-15 10:49:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:19,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 10:49:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:19,241 INFO L225 Difference]: With dead ends: 15 [2019-02-15 10:49:19,242 INFO L226 Difference]: Without dead ends: 12 [2019-02-15 10:49:19,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:49:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-15 10:49:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-15 10:49:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 10:49:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-02-15 10:49:19,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-02-15 10:49:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:19,248 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-02-15 10:49:19,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:49:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-15 10:49:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:19,249 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:19,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:19,250 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-02-15 10:49:19,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:19,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:19,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:19,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:19,302 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:19,302 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-02-15 10:49:19,304 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:19,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:19,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:19,390 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:49:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:19,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:19,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:19,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:19,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:19,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:19,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:19,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-15 10:49:19,488 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-15 10:49:19,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:19,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:19,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-15 10:49:19,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:19,506 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:19,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:19,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:19,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:19,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:19,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:19,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:19,569 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:19,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:19,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:19,587 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:19,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:19,623 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-15 10:49:19,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:19,668 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-15 10:49:19,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:19,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:19,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:19,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:19,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:19,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:19,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:19,748 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-02-15 10:49:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:19,892 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-02-15 10:49:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:19,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:49:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:19,894 INFO L225 Difference]: With dead ends: 21 [2019-02-15 10:49:19,894 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 10:49:19,895 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-15 10:49:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 10:49:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-02-15 10:49:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 10:49:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-02-15 10:49:19,900 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-02-15 10:49:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:19,900 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-02-15 10:49:19,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-02-15 10:49:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:19,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:19,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:19,901 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-15 10:49:19,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:19,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:19,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:19,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:19,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:19,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:19,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:19,956 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-15 10:49:19,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:19,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:19,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:19,963 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:49:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:19,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:19,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:19,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:19,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:19,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:20,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:20,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:20,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-15 10:49:20,111 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-15 10:49:20,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:20,147 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:20,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,174 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-15 10:49:20,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,201 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-15 10:49:20,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:20,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-15 10:49:20,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,309 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-15 10:49:20,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-15 10:49:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:20,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:20,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:20,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:20,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:20,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:20,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:20,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:20,394 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-02-15 10:49:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:20,636 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-02-15 10:49:20,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:20,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:20,638 INFO L225 Difference]: With dead ends: 35 [2019-02-15 10:49:20,638 INFO L226 Difference]: Without dead ends: 34 [2019-02-15 10:49:20,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-15 10:49:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-15 10:49:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-02-15 10:49:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 10:49:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-02-15 10:49:20,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-02-15 10:49:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:20,646 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-02-15 10:49:20,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-02-15 10:49:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:20,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:20,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:20,648 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-02-15 10:49:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:20,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:20,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:20,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:20,695 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-02-15 10:49:20,696 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:20,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:20,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:20,700 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:49:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:20,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:20,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:20,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:20,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:20,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:20,726 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-15 10:49:20,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-15 10:49:20,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-15 10:49:20,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,779 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-15 10:49:20,779 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-02-15 10:49:20,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:20,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-15 10:49:20,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:20,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 10:49:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:20,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:20,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:49:20,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-15 10:49:20,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:20,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:49:20,843 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-02-15 10:49:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:20,899 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-02-15 10:49:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:49:20,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:49:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:20,901 INFO L225 Difference]: With dead ends: 30 [2019-02-15 10:49:20,901 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 10:49:20,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:49:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 10:49:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-02-15 10:49:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:49:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-02-15 10:49:20,910 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-02-15 10:49:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:20,910 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-02-15 10:49:20,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-02-15 10:49:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:20,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:20,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:20,912 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-15 10:49:20,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:20,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:20,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:21,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:21,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:21,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:21,015 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-15 10:49:21,016 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:21,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:21,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:21,021 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:49:21,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:21,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:21,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:21,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:21,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:21,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:21,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:21,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:21,074 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-15 10:49:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,083 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-15 10:49:21,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:21,198 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,205 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,216 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:21,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,246 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-15 10:49:21,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,256 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-15 10:49:21,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:21,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,294 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-15 10:49:21,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,310 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-15 10:49:21,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-15 10:49:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:21,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:21,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:21,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:49:21,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:21,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:21,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:49:21,392 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-02-15 10:49:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:21,774 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-02-15 10:49:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:21,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:49:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:21,776 INFO L225 Difference]: With dead ends: 48 [2019-02-15 10:49:21,776 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 10:49:21,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:49:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 10:49:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-02-15 10:49:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:49:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-15 10:49:21,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-15 10:49:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:21,788 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-15 10:49:21,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-15 10:49:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:49:21,788 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:21,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:49:21,789 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-02-15 10:49:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:21,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:21,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:21,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:21,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:49:21,919 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-02-15 10:49:21,920 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:21,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:21,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:21,925 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:49:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:21,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:21,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:21,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:21,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:21,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:21,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-02-15 10:49:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:21,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-15 10:49:21,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:21,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:21,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-15 10:49:21,992 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 17 treesize of output 24 [2019-02-15 10:49:21,993 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:22,019 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-15 10:49:22,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:22,087 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-15 10:49:22,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,095 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-15 10:49:22,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-15 10:49:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:22,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:22,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:22,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:49:22,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:22,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:49:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:49:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:22,351 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-02-15 10:49:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:22,539 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-02-15 10:49:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:49:22,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:49:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:22,540 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:49:22,540 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:49:22,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:49:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:49:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-02-15 10:49:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:49:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-02-15 10:49:22,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-02-15 10:49:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:22,552 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-02-15 10:49:22,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:49:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-02-15 10:49:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:22,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:22,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:22,553 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-02-15 10:49:22,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:22,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:22,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:22,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:22,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:22,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:22,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:22,699 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-02-15 10:49:22,701 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:22,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:22,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:22,706 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:49:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:22,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:22,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:22,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:22,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:22,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:22,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:22,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:22,767 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-15 10:49:22,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:22,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:22,856 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 17 treesize of output 24 [2019-02-15 10:49:22,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,910 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 11 treesize of output 14 [2019-02-15 10:49:22,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:22,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:22,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-15 10:49:22,926 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:22,943 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-15 10:49:22,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:22,985 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-15 10:49:22,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,995 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-15 10:49:22,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-15 10:49:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:23,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:49:23,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-02-15 10:49:23,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:49:23,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:49:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:49:23,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:23,041 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-02-15 10:49:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:23,114 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-02-15 10:49:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:49:23,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:49:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:23,115 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:49:23,116 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 10:49:23,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:49:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 10:49:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-02-15 10:49:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 10:49:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-02-15 10:49:23,129 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-02-15 10:49:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:23,130 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-02-15 10:49:23,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:49:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-02-15 10:49:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:23,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:23,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:23,131 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-02-15 10:49:23,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:23,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:23,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:23,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:23,187 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-15 10:49:23,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:23,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:23,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:23,188 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-02-15 10:49:23,189 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:23,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:23,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:23,196 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:49:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:23,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:23,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:23,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:23,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:23,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:23,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:23,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:23,236 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-15 10:49:23,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,251 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-15 10:49:23,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:23,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:23,318 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,370 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-15 10:49:23,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,381 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-15 10:49:23,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:23,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,399 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:23,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-15 10:49:23,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,412 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-15 10:49:23,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-15 10:49:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:23,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:49:23,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:23,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:49:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:49:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:49:23,463 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-02-15 10:49:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:23,713 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-02-15 10:49:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:49:23,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 10:49:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:23,715 INFO L225 Difference]: With dead ends: 38 [2019-02-15 10:49:23,715 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:49:23,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:49:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:49:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-02-15 10:49:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:49:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-02-15 10:49:23,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-02-15 10:49:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:23,724 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-02-15 10:49:23,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:49:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-02-15 10:49:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:23,725 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:23,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:23,726 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:23,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-02-15 10:49:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:23,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:23,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:23,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:23,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:23,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:23,792 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-02-15 10:49:23,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:23,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:23,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:23,805 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:49:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:23,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:23,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:23,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:23,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:23,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:23,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-15 10:49:23,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:23,858 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-15 10:49:23,862 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-15 10:49:23,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:23,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-02-15 10:49:23,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,909 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-15 10:49:23,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-15 10:49:23,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:23,967 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-15 10:49:23,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:23,976 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-15 10:49:23,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-15 10:49:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:23,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:24,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:24,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:24,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:24,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:24,049 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-02-15 10:49:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:24,374 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-02-15 10:49:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:24,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:24,376 INFO L225 Difference]: With dead ends: 45 [2019-02-15 10:49:24,376 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 10:49:24,377 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-15 10:49:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 10:49:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-15 10:49:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:49:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-02-15 10:49:24,388 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-02-15 10:49:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:24,388 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-02-15 10:49:24,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-02-15 10:49:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:24,389 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:24,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:24,389 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-02-15 10:49:24,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:24,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:24,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:24,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:24,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:24,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:24,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:24,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:24,480 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-02-15 10:49:24,481 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:24,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:24,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:24,485 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:49:24,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:24,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:24,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:24,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:24,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:24,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:24,505 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-15 10:49:24,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-15 10:49:24,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,516 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 17 treesize of output 24 [2019-02-15 10:49:24,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-02-15 10:49:24,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-15 10:49:24,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-15 10:49:24,589 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-15 10:49:24,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,611 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-15 10:49:24,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-15 10:49:24,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:24,662 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-15 10:49:24,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:24,669 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-15 10:49:24,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-15 10:49:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:24,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:24,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:24,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:49:24,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:24,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:49:24,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:49:24,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:49:24,721 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-02-15 10:49:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:24,880 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-02-15 10:49:24,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:49:24,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:49:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:24,882 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:49:24,882 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 10:49:24,883 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-15 10:49:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 10:49:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-02-15 10:49:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 10:49:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-02-15 10:49:24,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-02-15 10:49:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:24,894 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-02-15 10:49:24,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:49:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-02-15 10:49:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:49:24,895 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:24,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:49:24,895 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-02-15 10:49:24,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:24,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:24,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:25,044 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-02-15 10:49:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:25,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:25,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:25,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:49:25,115 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-15 10:49:25,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:25,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:25,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:25,119 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:49:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:25,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:25,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:25,120 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-15 10:49:25,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:25,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:25,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:25,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:25,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:25,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:25,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-15 10:49:25,258 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-15 10:49:25,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,292 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:25,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,316 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-15 10:49:25,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,326 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-15 10:49:25,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:25,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,347 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:25,348 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-15 10:49:25,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,361 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-15 10:49:25,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-02-15 10:49:25,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,396 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-15 10:49:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,413 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-15 10:49:25,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-15 10:49:25,429 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-15 10:49:25,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:25,480 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-15 10:49:25,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:25,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:49:25,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:25,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:49:25,501 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-02-15 10:49:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:25,696 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-02-15 10:49:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:49:25,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:49:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:25,698 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:49:25,698 INFO L226 Difference]: Without dead ends: 48 [2019-02-15 10:49:25,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:49:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-15 10:49:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-02-15 10:49:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:49:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-15 10:49:25,709 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-02-15 10:49:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:25,709 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-15 10:49:25,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-15 10:49:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:49:25,710 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:25,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:49:25,710 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-02-15 10:49:25,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:25,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:25,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:25,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:25,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:25,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:49:25,937 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-02-15 10:49:25,939 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:25,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:25,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:25,943 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:49:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:25,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:25,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:25,943 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-15 10:49:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:25,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:25,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:25,967 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-15 10:49:25,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-15 10:49:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:25,977 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 17 treesize of output 24 [2019-02-15 10:49:25,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:25,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-02-15 10:49:26,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-15 10:49:26,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,043 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-02-15 10:49:26,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:49:26,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:49:26,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-15 10:49:26,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-15 10:49:26,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-15 10:49:26,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,175 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:26,176 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-15 10:49:26,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-15 10:49:26,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-15 10:49:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:26,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:26,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:26,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-15 10:49:26,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:26,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:26,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:49:26,303 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-02-15 10:49:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:26,603 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-02-15 10:49:26,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:49:26,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:49:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:26,604 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:49:26,604 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 10:49:26,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:49:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 10:49:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-02-15 10:49:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 10:49:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-02-15 10:49:26,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-02-15 10:49:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:26,614 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-02-15 10:49:26,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-02-15 10:49:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:49:26,615 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:26,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:49:26,615 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-02-15 10:49:26,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:26,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:26,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:26,703 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-15 10:49:26,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:26,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:26,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:49:26,704 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-02-15 10:49:26,705 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:49:26,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:49:26,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:49:26,709 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:49:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:26,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:49:26,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:26,710 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-15 10:49:26,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:26,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:26,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:26,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-15 10:49:26,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-15 10:49:26,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-15 10:49:26,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-02-15 10:49:26,790 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-15 10:49:26,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,819 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-15 10:49:26,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-15 10:49:26,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,934 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-15 10:49:26,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-15 10:49:26,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,955 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-15 10:49:26,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:26,970 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-15 10:49:26,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-02-15 10:49:26,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,995 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:49:26,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:49:26,997 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-15 10:49:26,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:27,018 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-15 10:49:27,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-15 10:49:27,035 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-15 10:49:27,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:27,070 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-15 10:49:27,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:27,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:49:27,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:27,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:49:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:49:27,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:49:27,091 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-02-15 10:49:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:27,332 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-02-15 10:49:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:49:27,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:49:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:27,333 INFO L225 Difference]: With dead ends: 22 [2019-02-15 10:49:27,334 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:49:27,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:49:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:49:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:49:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:49:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:49:27,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-15 10:49:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:27,336 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:49:27,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:49:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:49:27,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:49:27,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:49:27,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:49:27,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:49:27,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:49:27,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-15 10:49:27,493 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-02-15 10:49:28,692 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-02-15 10:49:28,695 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-15 10:49:28,695 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-15 10:49:28,696 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-02-15 10:49:28,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-02-15 10:49:28,696 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-02-15 10:49:28,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-02-15 10:49:28,696 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-02-15 10:49:28,696 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-02-15 10:49:28,696 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-02-15 10:49:28,705 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:49:28 BoogieIcfgContainer [2019-02-15 10:49:28,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 10:49:28,706 INFO L168 Benchmark]: Toolchain (without parser) took 12911.77 ms. Allocated memory was 141.6 MB in the beginning and 302.5 MB in the end (delta: 161.0 MB). Free memory was 109.1 MB in the beginning and 96.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 7.1 GB. [2019-02-15 10:49:28,706 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.63 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:49:28,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.02 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 10:49:28,707 INFO L168 Benchmark]: Boogie Preprocessor took 32.20 ms. Allocated memory is still 141.6 MB. Free memory was 106.6 MB in the beginning and 105.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-02-15 10:49:28,707 INFO L168 Benchmark]: RCFGBuilder took 297.23 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 95.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-02-15 10:49:28,707 INFO L168 Benchmark]: TraceAbstraction took 12520.89 ms. Allocated memory was 141.6 MB in the beginning and 302.5 MB in the end (delta: 161.0 MB). Free memory was 95.4 MB in the beginning and 96.4 MB in the end (delta: -991.1 kB). Peak memory consumption was 160.0 MB. Max. memory is 7.1 GB. [2019-02-15 10:49:28,709 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.63 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.02 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.20 ms. Allocated memory is still 141.6 MB. Free memory was 106.6 MB in the beginning and 105.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 297.23 ms. Allocated memory is still 141.6 MB. Free memory was 105.6 MB in the beginning and 95.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12520.89 ms. Allocated memory was 141.6 MB in the beginning and 302.5 MB in the end (delta: 161.0 MB). Free memory was 95.4 MB in the beginning and 96.4 MB in the end (delta: -991.1 kB). Peak memory consumption was 160.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: 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: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 12.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...