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_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:13:14,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:13:14,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:13:14,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:13:14,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:13:14,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:13:14,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:13:14,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:13:14,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:13:14,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:13:14,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:13:14,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:13:14,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:13:14,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:13:14,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:13:14,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:13:14,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:13:14,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:13:14,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:13:14,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:13:14,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:13:14,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:13:14,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:13:14,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:13:14,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:13:14,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:13:14,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:13:14,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:13:14,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:13:14,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:13:14,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:13:14,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:13:14,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:13:14,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:13:14,602 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:13:14,603 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:13:14,603 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:13:14,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:13:14,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:13:14,634 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:13:14,634 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:13:14,637 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:13:14,637 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:13:14,637 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:13:14,637 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:13:14,638 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:13:14,638 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:13:14,638 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:13:14,639 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:13:14,639 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:13:14,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:13:14,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:13:14,641 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:13:14,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:13:14,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:13:14,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:13:14,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:13:14,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:13:14,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:13:14,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:13:14,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:13:14,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:13:14,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:13:14,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:13:14,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:13:14,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:13:14,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:13:14,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:13:14,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:13:14,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:13:14,647 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:13:14,647 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:13:14,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:13:14,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:13:14,648 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:13:14,648 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:13:14,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:13:14,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:13:14,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:13:14,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:13:14,727 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:13:14,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-12-03 17:13:14,729 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-12-03 17:13:14,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:13:14,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:13:14,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:14,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:13:14,770 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:13:14,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,806 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:13:14,806 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:13:14,806 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:13:14,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:13:14,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:13:14,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:13:14,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:13:14,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/1) ... [2018-12-03 17:13:14,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:13:14,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:13:14,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:13:14,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:13:14,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (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 [2018-12-03 17:13:14,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 17:13:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 17:13:14,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 17:13:15,096 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:13:15,097 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:13:15,097 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:15 BoogieIcfgContainer [2018-12-03 17:13:15,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:13:15,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:13:15,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:13:15,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:13:15,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:13:14" (1/2) ... [2018-12-03 17:13:15,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c8fe5 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:13:15, skipping insertion in model container [2018-12-03 17:13:15,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:13:15" (2/2) ... [2018-12-03 17:13:15,104 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-12-03 17:13:15,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:13:15,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:13:15,133 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:13:15,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:13:15,164 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:13:15,164 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:13:15,164 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:13:15,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:13:15,165 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:13:15,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:13:15,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:13:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:13:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:13:15,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:15,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:13:15,188 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:15,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:15,194 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 17:13:15,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:15,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:15,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:15,760 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-12-03 17:13:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:15,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:13:15,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:13:15,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:13:15,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:13:15,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:13:15,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:15,849 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-03 17:13:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:15,951 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:13:15,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:13:15,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-03 17:13:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:15,965 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:13:15,966 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:13:15,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:13:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:13:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 17:13:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:13:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:13:16,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 17:13:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:16,007 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:13:16,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:13:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:13:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:13:16,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:16,008 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:13:16,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:16,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 17:13:16,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:16,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:16,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:16,283 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:13:16,677 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-03 17:13:16,835 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 17:13:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:16,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:16,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:16,922 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 17:13:16,924 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 17:13:16,986 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:13:16,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:13:23,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:13:23,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:13:23,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:23,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:13:23,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:23,549 INFO L192 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 [2018-12-03 17:13:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:23,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:23,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:23,615 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:23,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:23,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:23,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:23,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:23,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:23,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:23,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:23,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:24,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:24,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-03 17:13:24,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:24,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:13:24,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:13:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:13:24,382 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-12-03 17:13:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:24,432 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:13:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:13:24,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-03 17:13:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:24,433 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:13:24,434 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:13:24,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:13:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:13:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 17:13:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:13:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:13:24,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 17:13:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:24,438 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:13:24,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:13:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:13:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:13:24,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:24,439 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 17:13:24,439 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:24,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:24,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 17:13:24,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:24,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:24,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:24,697 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-03 17:13:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:24,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:24,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:24,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:24,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:24,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:24,828 INFO L192 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 [2018-12-03 17:13:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:24,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:24,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:13:24,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:24,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:24,857 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:24,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:24,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:24,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:24,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:24,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:24,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:24,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:24,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:25,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:25,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-03 17:13:25,097 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:25,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:13:25,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:13:25,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:25,098 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-12-03 17:13:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:25,156 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:13:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:13:25,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-03 17:13:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:25,157 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:13:25,158 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:13:25,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:13:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:13:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 17:13:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:13:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:13:25,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 17:13:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:25,161 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:13:25,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:13:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:13:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:13:25,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:25,162 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 17:13:25,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:25,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 17:13:25,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:25,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:25,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:25,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:25,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:25,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:25,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:25,484 INFO L192 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 [2018-12-03 17:13:25,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:13:25,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:13:25,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:13:25,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:25,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:25,507 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:25,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:25,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:25,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:25,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:25,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:25,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:25,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:25,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:25,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:25,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-03 17:13:25,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:25,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:13:25,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:13:25,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:25,852 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-12-03 17:13:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:25,945 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:13:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:13:25,947 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-03 17:13:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:25,948 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:13:25,948 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:13:25,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:13:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:13:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-03 17:13:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:13:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:13:25,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 17:13:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:25,952 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:13:25,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:13:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:13:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:13:25,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:25,953 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 17:13:25,954 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:25,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:25,954 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 17:13:25,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:25,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:26,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:26,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:26,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:26,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:26,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:26,231 INFO L192 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 [2018-12-03 17:13:26,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:26,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:26,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:26,264 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:26,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:26,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:26,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:26,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:26,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:26,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:26,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:26,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:26,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:26,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2018-12-03 17:13:26,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:26,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:13:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:13:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:13:26,918 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-12-03 17:13:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:27,012 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:13:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:13:27,013 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-12-03 17:13:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:27,013 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:13:27,013 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:13:27,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:13:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:13:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-03 17:13:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:13:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:13:27,017 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 17:13:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:27,017 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:13:27,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:13:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:13:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:13:27,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:27,018 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 17:13:27,018 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:27,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:27,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 17:13:27,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:27,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:27,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:27,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:27,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:27,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:27,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:27,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:27,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:27,340 INFO L192 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 [2018-12-03 17:13:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:27,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:27,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:13:27,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:27,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:27,386 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:27,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:27,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:27,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:27,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:27,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:27,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:27,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:27,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:28,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2018-12-03 17:13:28,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:28,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:13:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:13:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:13:28,362 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-12-03 17:13:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:28,502 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:13:28,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:13:28,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-12-03 17:13:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:28,504 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:13:28,504 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:13:28,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:13:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:13:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-03 17:13:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:13:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:13:28,509 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 17:13:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:28,509 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:13:28,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:13:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:13:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:13:28,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:28,510 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 17:13:28,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:28,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 17:13:28,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:28,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:28,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:28,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:28,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:28,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:28,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:28,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:28,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:28,798 INFO L192 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 [2018-12-03 17:13:28,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:13:28,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:13:28,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:13:28,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:28,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:28,840 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:28,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:28,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:28,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:29,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:29,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:29,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:29,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:29,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:29,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2018-12-03 17:13:29,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:29,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:13:29,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:13:29,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:13:29,332 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-12-03 17:13:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:29,518 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:13:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:13:29,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-12-03 17:13:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:29,519 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:13:29,519 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:13:29,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:13:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:13:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-03 17:13:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:13:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:13:29,524 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 17:13:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:29,524 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:13:29,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:13:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:13:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:13:29,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:29,525 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 17:13:29,525 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:29,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 17:13:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:29,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:29,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:29,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:29,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:29,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:29,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:29,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:29,873 INFO L192 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 [2018-12-03 17:13:29,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:29,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:29,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:29,903 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:29,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:29,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:29,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:30,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:30,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:30,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:30,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:30,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:30,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:30,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2018-12-03 17:13:30,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:30,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:13:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:13:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:13:30,638 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-12-03 17:13:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:31,242 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:13:31,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:13:31,242 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-12-03 17:13:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:31,243 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:13:31,243 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:13:31,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:13:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:13:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-03 17:13:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:13:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:13:31,253 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 17:13:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:31,254 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:13:31,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:13:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:13:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:13:31,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:31,255 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 17:13:31,255 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:31,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 17:13:31,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:31,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:31,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:31,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:31,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:31,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:31,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:31,956 INFO L192 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 [2018-12-03 17:13:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:31,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:31,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 17:13:31,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:31,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:31,982 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:31,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:31,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:31,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:32,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:32,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:32,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:32,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:32,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:32,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:32,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2018-12-03 17:13:32,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:32,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:13:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:13:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:13:32,609 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-12-03 17:13:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:32,929 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:13:32,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:13:32,931 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-12-03 17:13:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:32,932 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:13:32,932 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:13:32,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:13:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:13:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-03 17:13:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:13:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:13:32,937 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 17:13:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:32,937 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:13:32,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:13:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:13:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:13:32,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:32,938 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 17:13:32,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:32,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 17:13:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:32,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:32,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:33,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:33,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:33,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:33,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:33,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:33,320 INFO L192 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 [2018-12-03 17:13:33,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:13:33,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:13:33,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:13:33,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:33,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:33,350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:33,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:33,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:33,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:33,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:33,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:33,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:33,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:33,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:34,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:34,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2018-12-03 17:13:34,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:34,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:13:34,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:13:34,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:13:34,009 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-12-03 17:13:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:34,288 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:13:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:13:34,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-12-03 17:13:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:34,289 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:13:34,289 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:13:34,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:13:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:13:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 17:13:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:13:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:13:34,295 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 17:13:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:34,296 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:13:34,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:13:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:13:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:13:34,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:34,297 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 17:13:34,297 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:34,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 17:13:34,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:34,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:34,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:34,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:34,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:34,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:34,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:34,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:34,806 INFO L192 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 [2018-12-03 17:13:34,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:34,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:34,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:34,854 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:34,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:34,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:34,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:35,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:35,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:35,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:35,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:35,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2018-12-03 17:13:35,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:35,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:13:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:13:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:13:35,719 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-12-03 17:13:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:36,002 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:13:36,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:13:36,003 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-03 17:13:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:36,004 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:13:36,004 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:13:36,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:13:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:13:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 17:13:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:13:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:13:36,010 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 17:13:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:36,010 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:13:36,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:13:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:13:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:13:36,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:36,011 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 17:13:36,012 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:36,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 17:13:36,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:36,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:36,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:36,533 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-12-03 17:13:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:36,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:36,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:36,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:36,565 INFO L192 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 [2018-12-03 17:13:36,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:36,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:36,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:13:36,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:36,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:36,593 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:36,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:36,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:36,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:37,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:37,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:37,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:37,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:37,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:37,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:37,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2018-12-03 17:13:37,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:37,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:13:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:13:37,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:13:37,764 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-12-03 17:13:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:38,303 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:13:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:13:38,304 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-12-03 17:13:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:38,305 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:13:38,305 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:13:38,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:13:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:13:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-03 17:13:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:13:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:13:38,310 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 17:13:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:38,310 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:13:38,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:13:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:13:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:13:38,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:38,311 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 17:13:38,311 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:38,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 17:13:38,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:38,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:38,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:38,670 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:13:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:39,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:39,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:39,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:39,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:39,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:39,036 INFO L192 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 [2018-12-03 17:13:39,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:13:39,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:13:39,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:13:39,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:39,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:39,061 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:39,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:39,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:39,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:39,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:39,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:39,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:39,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:39,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:40,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:40,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2018-12-03 17:13:40,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:40,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:13:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:13:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:13:40,101 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-12-03 17:13:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:40,555 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:13:40,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:13:40,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-12-03 17:13:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:40,556 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:13:40,556 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:13:40,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:13:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:13:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-03 17:13:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:13:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:13:40,562 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 17:13:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:40,563 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:13:40,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:13:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:13:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:13:40,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:40,564 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 17:13:40,564 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:40,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:40,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 17:13:40,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:40,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:40,818 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:41,062 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:13:41,365 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:42,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:42,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:42,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:42,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:42,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:42,163 INFO L192 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 [2018-12-03 17:13:42,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:42,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:42,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:42,222 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:42,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:42,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:42,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:42,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:42,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:42,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:42,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:42,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:43,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:43,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2018-12-03 17:13:43,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:43,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:13:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:13:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:13:43,296 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-12-03 17:13:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:44,044 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:13:44,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:13:44,045 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-12-03 17:13:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:44,046 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:13:44,046 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:13:44,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:13:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:13:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 17:13:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:13:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:13:44,059 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 17:13:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:44,059 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:13:44,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:13:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:13:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:13:44,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:44,060 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 17:13:44,060 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:44,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 17:13:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:44,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:44,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:44,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:44,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:44,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:44,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:44,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:44,657 INFO L192 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 [2018-12-03 17:13:44,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:44,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:44,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 17:13:44,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:44,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:44,716 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:44,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:44,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:44,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:45,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:45,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:45,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:45,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:45,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:46,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:46,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2018-12-03 17:13:46,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:46,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:13:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:13:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:13:46,179 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-12-03 17:13:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:46,918 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 17:13:46,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:13:46,919 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-12-03 17:13:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:46,920 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:13:46,920 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:13:46,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:13:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:13:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 17:13:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:13:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 17:13:46,927 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 17:13:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:46,927 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 17:13:46,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:13:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 17:13:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:13:46,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:46,928 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 17:13:46,928 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:46,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 17:13:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:46,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:46,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:46,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:47,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:47,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:47,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:47,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:47,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:47,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:13:47,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:13:47,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:13:47,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:13:47,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:47,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:47,654 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:47,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:47,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:47,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:48,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:48,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:48,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:48,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:48,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:49,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:49,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2018-12-03 17:13:49,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:49,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:13:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:13:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:13:49,301 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-12-03 17:13:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:49,794 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 17:13:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:13:49,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-12-03 17:13:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:49,796 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:13:49,796 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:13:49,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:13:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:13:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-03 17:13:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:13:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 17:13:49,802 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 17:13:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:49,802 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 17:13:49,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:13:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 17:13:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:13:49,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:49,803 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 17:13:49,803 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:49,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 17:13:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:49,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:49,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:50,040 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:13:50,295 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:13:50,556 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:13:50,772 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:13:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:51,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:51,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:51,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:51,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:51,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:51,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:13:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:51,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:13:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:51,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:51,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:51,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:51,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:51,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:51,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:51,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:51,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:51,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:51,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:52,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:52,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2018-12-03 17:13:52,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:52,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:13:52,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:13:52,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:13:52,966 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-12-03 17:13:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:53,883 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 17:13:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:13:53,883 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-12-03 17:13:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:53,884 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:13:53,884 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:13:53,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:13:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:13:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-03 17:13:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:13:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 17:13:53,892 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 17:13:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:53,892 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 17:13:53,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:13:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 17:13:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:13:53,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:53,893 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 17:13:53,893 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:53,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 17:13:53,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:13:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:53,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:54,124 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:54,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:54,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:54,770 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:54,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:54,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:54,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:13:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:13:54,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:13:54,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:13:54,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:54,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:54,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:54,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:54,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:54,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:55,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:55,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:55,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:55,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:55,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:13:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:56,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:13:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2018-12-03 17:13:56,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:13:56,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:13:56,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:13:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:13:56,533 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-12-03 17:13:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:13:57,546 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 17:13:57,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:13:57,547 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-12-03 17:13:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:13:57,548 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:13:57,548 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:13:57,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:13:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:13:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 17:13:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:13:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 17:13:57,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 17:13:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:13:57,554 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 17:13:57,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:13:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 17:13:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:13:57,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:13:57,555 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 17:13:57,555 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:13:57,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:13:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 17:13:57,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:13:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:57,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:13:57,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:13:57,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:13:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:13:57,747 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:13:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:58,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:58,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:13:58,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:13:58,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:13:58,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:13:58,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:13:58,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:13:58,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:13:58,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:13:58,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:13:58,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:13:58,411 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:13:58,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:58,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:58,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:13:59,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:13:59,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:13:59,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:13:59,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:13:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:13:59,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2018-12-03 17:14:00,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:00,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:14:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:14:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:14:00,113 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-12-03 17:14:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:01,160 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 17:14:01,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:14:01,160 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-12-03 17:14:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:01,161 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:14:01,161 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:14:01,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:14:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:14:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 17:14:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:14:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 17:14:01,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 17:14:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:01,167 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 17:14:01,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:14:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 17:14:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:14:01,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:01,168 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 17:14:01,168 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:01,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 17:14:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:01,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:01,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:02,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:02,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:02,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:02,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:02,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:02,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:02,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:02,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:02,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:02,120 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:02,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:02,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:02,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:03,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:03,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:03,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:03,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:03,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:04,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:04,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2018-12-03 17:14:04,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:04,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:14:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:14:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:14:04,397 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-12-03 17:14:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:05,240 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 17:14:05,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:14:05,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-12-03 17:14:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:05,242 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:14:05,242 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:14:05,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:14:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:14:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-03 17:14:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:14:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 17:14:05,248 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 17:14:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:05,249 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 17:14:05,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:14:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 17:14:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:14:05,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:05,250 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 17:14:05,250 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:05,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 17:14:05,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:05,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:05,410 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:14:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:06,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:06,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:06,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:06,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:06,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:06,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:06,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:06,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 17:14:06,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:06,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:06,057 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:06,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:06,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:06,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:07,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:07,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:07,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:07,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:07,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:08,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:08,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2018-12-03 17:14:08,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:08,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:14:08,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:14:08,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:14:08,597 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-12-03 17:14:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:09,438 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 17:14:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:14:09,438 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-12-03 17:14:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:09,439 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:14:09,439 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:14:09,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:14:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:14:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-03 17:14:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:14:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 17:14:09,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 17:14:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:09,446 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 17:14:09,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:14:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 17:14:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:14:09,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:09,447 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 17:14:09,447 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:09,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 17:14:09,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:09,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:09,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:09,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:09,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:10,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:10,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:10,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:10,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:10,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:10,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:10,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:10,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:10,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:10,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:10,255 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:10,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:10,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:10,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:11,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:11,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:11,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:11,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:11,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:12,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:12,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2018-12-03 17:14:12,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:12,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:14:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:14:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:14:12,534 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-12-03 17:14:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:13,738 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 17:14:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:14:13,741 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-12-03 17:14:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:13,741 INFO L225 Difference]: With dead ends: 50 [2018-12-03 17:14:13,741 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:14:13,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:14:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:14:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 17:14:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:14:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 17:14:13,746 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 17:14:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:13,746 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 17:14:13,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:14:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 17:14:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:14:13,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:13,747 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 17:14:13,748 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:13,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 17:14:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:13,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:13,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:14,029 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:14:14,295 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:14:14,560 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:14:14,881 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:14:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:15,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:15,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:15,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:15,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:15,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:15,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:15,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:15,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:15,634 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:15,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:15,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:15,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:16,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:16,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:16,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:16,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:16,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:18,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:18,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2018-12-03 17:14:18,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:18,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:14:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:14:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:14:18,198 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-12-03 17:14:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:19,283 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 17:14:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:14:19,284 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-12-03 17:14:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:19,284 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:14:19,285 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:14:19,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:14:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:14:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-03 17:14:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:14:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 17:14:19,291 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 17:14:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:19,291 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 17:14:19,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:14:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 17:14:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:14:19,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:19,292 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 17:14:19,293 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:19,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 17:14:19,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:19,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:19,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:20,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:20,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:20,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:20,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:20,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:20,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:20,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:20,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 17:14:20,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:20,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:20,153 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:20,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:20,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:20,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:21,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:21,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:21,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:21,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:21,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:22,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:22,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2018-12-03 17:14:22,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:22,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:14:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:14:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:14:22,907 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-12-03 17:14:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:24,426 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 17:14:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:14:24,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-12-03 17:14:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:24,428 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:14:24,428 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:14:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:14:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:14:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-03 17:14:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:14:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 17:14:24,434 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 17:14:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:24,434 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 17:14:24,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:14:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 17:14:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:14:24,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:24,435 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 17:14:24,436 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:24,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 17:14:24,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:24,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:24,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:24,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:24,689 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:14:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:25,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:25,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:25,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:25,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:25,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:25,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:25,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:25,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:25,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:25,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:25,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:25,684 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:25,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:25,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:25,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:26,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:26,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:26,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:26,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:26,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:29,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:29,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2018-12-03 17:14:29,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:29,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:14:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:14:29,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:14:29,663 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-12-03 17:14:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:30,830 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 17:14:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:14:30,831 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-12-03 17:14:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:30,831 INFO L225 Difference]: With dead ends: 56 [2018-12-03 17:14:30,831 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:14:30,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:14:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:14:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-03 17:14:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:14:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 17:14:30,836 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 17:14:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:30,837 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 17:14:30,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:14:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 17:14:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:14:30,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:30,838 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 17:14:30,838 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:30,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 17:14:30,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:30,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:30,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:31,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:31,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:31,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:31,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:31,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:31,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:31,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:31,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:31,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:31,774 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:31,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:31,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:31,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:32,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:32,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:32,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:32,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:32,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:34,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:34,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2018-12-03 17:14:34,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:34,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:14:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:14:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 17:14:34,984 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-12-03 17:14:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:36,197 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 17:14:36,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:14:36,198 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-12-03 17:14:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:36,198 INFO L225 Difference]: With dead ends: 58 [2018-12-03 17:14:36,199 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:14:36,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 17:14:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:14:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 17:14:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:14:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 17:14:36,206 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 17:14:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:36,207 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 17:14:36,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:14:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 17:14:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:14:36,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:36,208 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 17:14:36,208 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:36,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 17:14:36,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:36,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:36,453 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:14:36,687 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:14:36,949 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:14:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:37,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:37,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:37,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:37,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:37,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:37,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:37,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:37,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:37,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 17:14:37,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:37,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:37,951 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:37,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:37,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:37,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:39,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:39,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:39,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:39,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:39,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:41,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2018-12-03 17:14:41,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:14:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:14:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:14:41,441 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-12-03 17:14:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:43,297 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 17:14:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:14:43,297 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-12-03 17:14:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:43,298 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:14:43,298 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:14:43,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:14:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:14:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-03 17:14:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:14:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 17:14:43,302 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 17:14:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:43,303 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 17:14:43,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:14:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 17:14:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:14:43,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:43,303 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 17:14:43,304 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:43,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:43,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 17:14:43,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:43,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:43,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:43,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:44,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:44,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:44,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:44,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:44,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:44,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:14:44,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:14:44,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:14:44,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:44,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:44,499 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:44,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:44,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:44,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:45,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:45,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:45,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:45,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:45,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:47,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:47,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2018-12-03 17:14:47,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:47,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:14:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:14:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:14:47,854 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-12-03 17:14:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:49,472 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 17:14:49,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:14:49,472 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-12-03 17:14:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:49,473 INFO L225 Difference]: With dead ends: 62 [2018-12-03 17:14:49,474 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:14:49,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:14:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:14:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-03 17:14:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:14:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 17:14:49,478 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 17:14:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:49,478 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 17:14:49,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:14:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 17:14:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:14:49,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:49,479 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 17:14:49,479 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:49,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 17:14:49,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:49,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:49,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:14:49,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:49,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:49,740 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:14:49,969 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:14:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:50,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:50,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:50,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:50,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:50,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:50,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:50,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:50,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:14:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:50,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:50,963 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:50,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:50,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:50,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:52,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:52,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:52,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:52,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:52,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:14:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:54,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:14:54,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2018-12-03 17:14:54,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:14:54,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:14:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:14:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:14:54,783 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-12-03 17:14:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:14:56,274 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 17:14:56,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:14:56,274 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-12-03 17:14:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:14:56,275 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:14:56,275 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:14:56,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:14:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:14:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-12-03 17:14:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:14:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 17:14:56,281 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 17:14:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:14:56,281 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 17:14:56,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:14:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 17:14:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:14:56,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:14:56,282 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 17:14:56,283 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:14:56,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:14:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 17:14:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:14:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:14:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:14:56,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:14:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:14:56,466 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:14:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:57,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:14:57,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:14:57,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:14:57,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:14:57,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:14:57,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:14:57,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:14:57,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 17:14:57,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:14:57,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:14:57,514 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:14:57,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:57,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:57,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:14:59,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:14:59,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:14:59,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:14:59,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:14:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:14:59,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:01,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:01,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2018-12-03 17:15:01,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:01,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:15:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:15:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 17:15:01,601 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-12-03 17:15:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:03,501 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 17:15:03,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:15:03,502 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-12-03 17:15:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:03,503 INFO L225 Difference]: With dead ends: 66 [2018-12-03 17:15:03,503 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:15:03,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 17:15:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:15:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 17:15:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:15:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 17:15:03,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 17:15:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:03,508 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 17:15:03,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:15:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 17:15:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:15:03,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:03,509 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 17:15:03,509 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:03,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:03,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 17:15:03,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:03,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:03,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:03,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:04,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:04,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:04,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:04,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:04,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:04,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:04,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:04,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:05,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:05,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:05,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:05,016 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:05,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:05,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:05,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:15:06,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:15:06,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:06,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:06,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:15:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:06,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:09,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:09,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2018-12-03 17:15:09,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:09,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:15:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:15:09,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:15:09,271 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-12-03 17:15:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:10,942 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 17:15:10,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:15:10,942 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-12-03 17:15:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:10,943 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:15:10,943 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:15:10,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:15:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:15:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-03 17:15:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:15:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 17:15:10,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 17:15:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:10,949 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 17:15:10,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:15:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 17:15:10,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:15:10,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:10,950 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 17:15:10,950 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:10,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 17:15:10,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:10,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:10,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:10,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:10,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:12,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:12,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:12,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:12,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:12,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:12,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:12,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:12,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:12,226 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:12,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:12,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:15:13,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:15:13,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:13,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:13,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:15:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:13,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:16,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2018-12-03 17:15:16,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:16,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:15:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:15:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 17:15:16,823 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-12-03 17:15:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:18,763 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 17:15:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:15:18,763 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-12-03 17:15:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:18,764 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:15:18,764 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:15:18,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 17:15:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:15:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-03 17:15:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:15:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 17:15:18,769 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 17:15:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:18,769 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 17:15:18,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:15:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 17:15:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:15:18,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:18,770 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 17:15:18,770 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:18,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 17:15:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:18,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:20,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:20,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:20,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:20,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:20,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:20,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:20,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:20,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:20,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 17:15:20,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:20,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:20,303 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:20,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:20,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:20,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:15:21,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:15:21,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:21,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:21,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:15:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:21,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:25,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:25,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2018-12-03 17:15:25,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:25,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:15:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:15:25,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:15:25,042 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-12-03 17:15:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:27,729 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 17:15:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:15:27,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-12-03 17:15:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:27,731 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:15:27,731 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:15:27,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:15:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:15:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-12-03 17:15:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:15:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 17:15:27,735 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 17:15:27,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:27,735 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 17:15:27,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:15:27,735 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 17:15:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:15:27,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:27,736 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 17:15:27,736 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:27,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:27,736 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 17:15:27,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:27,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:27,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:27,965 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:15:28,187 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:15:28,431 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:15:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:29,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:29,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:29,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:29,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:29,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:29,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:29,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:29,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:29,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:29,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:29,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:29,896 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:29,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:29,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:29,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:15:31,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:15:31,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:31,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:31,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:15:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:31,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:34,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:34,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2018-12-03 17:15:34,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:34,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:15:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:15:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 17:15:34,858 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-12-03 17:15:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:37,137 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 17:15:37,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:15:37,137 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-12-03 17:15:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:37,138 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:15:37,139 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:15:37,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 17:15:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:15:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 17:15:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:15:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 17:15:37,144 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 17:15:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:37,144 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 17:15:37,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:15:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 17:15:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:15:37,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:37,145 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 17:15:37,145 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:37,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 17:15:37,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:37,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:37,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:37,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:37,353 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:15:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:38,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:38,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:38,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:38,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:38,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:38,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:38,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:38,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:15:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:38,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:38,638 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:38,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:38,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:38,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:15:40,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:15:40,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:40,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:40,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:15:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:40,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:43,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:43,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2018-12-03 17:15:43,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:43,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:15:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:15:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:15:43,932 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-12-03 17:15:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:46,515 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 17:15:46,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:15:46,515 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-12-03 17:15:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:46,516 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:15:46,517 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:15:46,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:15:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:15:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-03 17:15:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:15:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 17:15:46,522 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 17:15:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:46,522 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 17:15:46,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:15:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 17:15:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:15:46,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:46,523 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 17:15:46,523 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:46,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:46,524 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 17:15:46,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:46,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:15:46,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:46,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:46,752 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:15:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:48,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:48,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:48,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:48,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:48,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:48,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:48,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:15:48,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:15:48,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 17:15:48,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:48,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:48,248 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:48,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:48,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:48,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:15:50,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:15:50,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:50,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:50,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:15:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:50,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:15:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:53,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:15:53,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2018-12-03 17:15:53,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:15:53,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:15:53,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:15:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 17:15:53,726 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-12-03 17:15:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:15:56,847 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 17:15:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:15:56,848 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-12-03 17:15:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:15:56,849 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:15:56,849 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:15:56,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 17:15:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:15:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-03 17:15:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:15:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 17:15:56,853 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 17:15:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:15:56,854 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 17:15:56,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:15:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 17:15:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:15:56,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:15:56,854 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 17:15:56,854 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:15:56,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:15:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 17:15:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:15:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:56,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:15:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:15:56,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:15:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:15:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:15:58,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:58,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:15:58,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:15:58,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:15:58,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:15:58,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:15:58,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:15:58,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:15:58,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:15:58,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:15:58,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:15:58,445 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:15:58,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:15:58,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:15:58,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:16:00,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:16:00,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:00,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:00,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:16:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:00,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:04,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:04,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2018-12-03 17:16:04,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:04,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:16:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:16:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:16:04,342 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-12-03 17:16:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:07,415 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 17:16:07,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:16:07,415 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-12-03 17:16:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:07,416 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:16:07,416 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:16:07,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:16:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:16:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-12-03 17:16:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:16:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 17:16:07,420 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 17:16:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 17:16:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:16:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 17:16:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:16:07,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:07,422 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 17:16:07,422 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:07,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 17:16:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:07,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:07,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:07,663 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:16:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:09,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:09,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:09,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:09,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:09,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:09,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:09,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:09,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:09,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:09,194 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:16:09,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:09,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:09,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:16:11,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:16:11,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:11,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:11,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:16:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:11,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:15,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:15,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2018-12-03 17:16:15,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:15,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:16:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:16:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 17:16:15,288 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-12-03 17:16:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:18,161 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 17:16:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:16:18,162 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-12-03 17:16:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:18,163 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:16:18,163 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:16:18,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 17:16:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:16:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 17:16:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:16:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 17:16:18,166 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 17:16:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:18,167 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 17:16:18,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:16:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 17:16:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:16:18,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:18,167 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 17:16:18,167 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:18,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 17:16:18,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:18,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:18,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:18,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:19,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:19,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:19,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:19,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:19,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:19,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:19,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:19,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:19,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 17:16:19,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:19,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:19,893 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:16:19,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:19,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:19,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:16:22,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:16:22,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:22,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:22,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:16:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:22,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:26,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:26,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2018-12-03 17:16:26,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:26,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:16:26,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:16:26,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:16:26,504 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-12-03 17:16:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:29,986 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 17:16:29,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:16:29,987 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-12-03 17:16:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:29,988 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:16:29,988 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:16:29,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:16:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:16:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-03 17:16:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:16:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 17:16:29,991 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 17:16:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:29,992 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 17:16:29,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:16:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 17:16:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:16:29,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:29,992 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 17:16:29,992 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:29,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 17:16:29,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:29,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:29,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:30,225 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:16:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:32,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:32,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:32,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:32,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:32,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:32,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:32,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:16:32,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:16:32,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:16:32,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:32,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:32,139 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:16:32,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:32,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:32,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:16:34,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:16:34,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:34,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:34,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:16:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:34,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:38,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:38,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2018-12-03 17:16:38,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:16:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:16:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 17:16:38,732 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-12-03 17:16:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:41,711 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 17:16:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:16:41,712 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-12-03 17:16:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:41,713 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:16:41,713 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:16:41,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 17:16:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:16:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-03 17:16:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:16:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 17:16:41,718 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 17:16:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:41,718 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 17:16:41,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:16:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 17:16:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:16:41,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:41,719 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 17:16:41,719 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:41,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 17:16:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:41,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:16:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:41,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:41,964 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:16:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:43,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:43,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:43,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:43,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:43,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:43,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:43,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:43,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:16:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:43,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:43,671 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:16:43,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:43,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:43,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:16:46,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:16:46,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:46,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:46,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:16:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:46,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:16:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:50,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:16:50,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2018-12-03 17:16:50,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:16:50,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:16:50,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:16:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:16:50,720 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-12-03 17:16:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:16:54,840 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 17:16:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:16:54,841 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-12-03 17:16:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:16:54,842 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:16:54,842 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:16:54,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:16:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:16:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-12-03 17:16:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:16:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 17:16:54,847 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 17:16:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:16:54,847 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 17:16:54,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:16:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 17:16:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:16:54,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:16:54,848 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 17:16:54,849 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:16:54,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:16:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 17:16:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:16:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:54,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:16:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:16:54,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:16:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:16:55,040 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:16:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:56,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:56,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:16:56,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:16:56,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:16:56,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:16:56,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:16:56,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:16:56,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:16:56,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 17:16:56,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:16:56,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:16:56,980 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:16:56,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:56,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:56,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:16:59,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:16:59,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:16:59,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:16:59,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:16:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:16:59,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:04,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:04,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2018-12-03 17:17:04,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:04,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:17:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:17:04,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 17:17:04,360 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-12-03 17:17:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:09,033 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 17:17:09,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:17:09,034 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-12-03 17:17:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:09,035 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:17:09,035 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:17:09,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 17:17:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:17:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 17:17:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:17:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 17:17:09,041 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 17:17:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:09,041 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 17:17:09,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:17:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 17:17:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:17:09,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:09,042 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 17:17:09,042 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:09,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 17:17:09,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:09,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:09,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:09,241 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:17:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:11,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:11,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:11,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:11,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:11,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:11,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:11,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:17:11,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:11,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:11,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:11,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:11,061 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:17:11,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:11,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:11,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:17:13,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:17:13,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:13,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:13,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:17:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:14,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:19,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:19,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2018-12-03 17:17:19,011 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:19,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:17:19,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:17:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:17:19,013 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-12-03 17:17:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:23,784 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 17:17:23,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:17:23,784 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-12-03 17:17:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:23,785 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:17:23,785 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:17:23,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:17:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:17:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-03 17:17:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:17:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 17:17:23,790 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 17:17:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:23,790 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 17:17:23,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:17:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 17:17:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:17:23,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:23,791 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 17:17:23,791 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:23,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 17:17:23,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:23,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:23,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:23,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:23,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:24,040 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:17:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:25,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:25,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:25,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:25,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:25,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:25,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:25,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:25,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:17:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:25,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:25,963 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:17:25,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:25,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:25,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:17:28,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:17:28,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:28,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:28,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:17:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:29,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:34,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:34,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2018-12-03 17:17:34,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:34,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:17:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:17:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 17:17:34,096 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-12-03 17:17:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:37,963 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 17:17:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:17:37,964 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-12-03 17:17:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:37,965 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:17:37,965 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:17:37,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 17:17:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:17:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-03 17:17:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:17:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 17:17:37,970 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 17:17:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:37,970 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 17:17:37,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:17:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 17:17:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:17:37,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:37,971 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 17:17:37,971 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:37,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 17:17:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:17:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:37,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:38,230 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:17:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:40,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:40,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:40,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:40,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:40,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:40,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:40,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:17:40,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:17:40,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 17:17:40,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:40,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:40,296 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:17:40,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:40,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:40,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:17:43,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:17:43,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:43,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:43,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:17:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:44,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:17:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:49,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:17:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2018-12-03 17:17:49,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:17:49,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:17:49,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:17:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:17:49,342 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-12-03 17:17:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:17:53,565 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 17:17:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:17:53,566 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-12-03 17:17:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:17:53,567 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:17:53,567 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:17:53,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:17:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:17:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-03 17:17:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:17:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 17:17:53,573 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 17:17:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:17:53,573 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 17:17:53,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:17:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 17:17:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:17:53,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:17:53,574 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 17:17:53,574 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:17:53,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:17:53,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 17:17:53,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:17:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:53,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:17:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:17:53,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:17:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:17:53,852 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:17:54,110 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:17:54,377 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:17:54,693 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:17:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:17:56,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:56,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:17:56,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:17:56,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:17:56,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:17:56,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:17:56,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:17:56,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:17:56,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:17:56,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:17:56,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:17:56,768 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:17:56,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:17:56,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:17:56,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:18:00,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:18:00,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:00,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:00,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:18:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:00,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:05,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:05,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2018-12-03 17:18:05,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:05,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:18:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:18:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 17:18:05,746 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-12-03 17:18:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:10,397 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 17:18:10,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:18:10,397 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-12-03 17:18:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:10,398 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:18:10,398 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:18:10,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 17:18:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:18:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 17:18:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:18:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 17:18:10,403 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 17:18:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:10,404 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 17:18:10,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:18:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 17:18:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:18:10,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:10,404 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 17:18:10,404 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:10,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:10,405 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 17:18:10,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:10,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:10,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:10,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:10,666 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:18:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:12,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:12,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:12,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:12,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:12,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:18:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:12,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:12,758 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:18:12,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:12,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:12,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:18:16,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:18:16,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:16,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:16,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:18:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:16,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:21,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:21,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2018-12-03 17:18:21,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:21,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:18:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:18:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:18:21,867 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-12-03 17:18:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:26,117 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 17:18:26,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:18:26,117 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-12-03 17:18:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:26,118 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:18:26,118 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:18:26,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:18:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:18:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 17:18:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:18:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 17:18:26,123 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 17:18:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:26,123 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 17:18:26,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:18:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 17:18:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:18:26,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:26,124 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 17:18:26,124 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:26,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:26,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 17:18:26,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:26,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:18:26,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:26,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:28,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:28,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:28,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:28,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:28,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:28,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:28,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:18:28,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:18:28,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 17:18:28,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:28,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:28,464 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:18:28,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:28,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:28,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:18:33,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:18:33,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:33,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:33,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:18:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:33,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:39,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:39,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2018-12-03 17:18:39,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:39,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:18:39,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:18:39,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 17:18:39,287 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-12-03 17:18:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:18:43,439 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 17:18:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:18:43,439 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-12-03 17:18:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:18:43,441 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:18:43,441 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:18:43,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 17:18:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:18:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-03 17:18:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:18:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 17:18:43,446 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 17:18:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:18:43,446 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 17:18:43,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:18:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 17:18:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:18:43,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:18:43,447 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 17:18:43,447 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:18:43,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:18:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 17:18:43,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:18:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:43,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:18:43,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:18:43,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:18:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:18:43,709 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:18:43,937 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:18:44,212 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:18:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:46,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:46,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:18:46,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:18:46,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:18:46,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:18:46,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:18:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:18:46,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:18:46,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:18:46,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:18:46,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:18:46,363 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:18:46,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:46,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:46,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:18:49,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:18:49,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:18:49,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:18:49,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:18:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:49,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:18:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:18:56,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:18:56,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2018-12-03 17:18:56,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:18:56,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:18:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:18:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:18:56,136 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-12-03 17:19:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:00,581 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 17:19:00,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:19:00,582 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-12-03 17:19:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:00,583 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:19:00,583 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:19:00,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:19:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:19:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-03 17:19:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:19:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 17:19:00,591 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 17:19:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:00,591 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 17:19:00,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:19:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 17:19:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:19:00,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:00,592 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 17:19:00,592 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:00,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 17:19:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:00,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:00,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:02,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:02,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:02,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:02,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:02,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:02,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:19:02,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:02,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:19:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:02,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:02,990 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:19:02,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:19:03,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:19:03,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:19:06,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:19:06,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:19:06,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:19:06,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:19:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:06,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:13,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:13,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2018-12-03 17:19:13,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:13,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:19:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:19:13,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 17:19:13,338 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-12-03 17:19:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:18,176 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 17:19:18,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:19:18,177 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-12-03 17:19:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:18,178 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:19:18,178 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:19:18,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 17:19:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:19:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 17:19:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:19:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 17:19:18,185 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 17:19:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:18,185 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 17:19:18,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:19:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 17:19:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:19:18,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:18,186 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 17:19:18,186 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:18,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 17:19:18,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:18,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:19:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:18,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:18,460 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:19:18,702 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:19:18,960 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:19:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:21,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:21,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:21,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:21,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:21,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:21,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:19:21,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:19:21,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:19:21,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 17:19:21,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:21,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:21,800 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:19:21,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:19:21,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:19:21,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:19:25,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:19:25,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:19:25,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:19:25,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:19:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:25,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2018-12-03 17:19:32,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:32,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:19:32,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:19:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:19:32,346 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2018-12-03 17:19:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:37,993 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 17:19:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:19:37,994 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2018-12-03 17:19:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:37,995 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:19:37,996 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:19:37,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:19:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:19:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 17:19:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:19:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 17:19:38,001 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 17:19:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:38,002 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 17:19:38,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:19:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 17:19:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:19:38,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:38,003 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 17:19:38,003 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:38,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 17:19:38,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:38,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:38,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:40,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:40,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:19:40,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:19:40,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:19:40,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:19:40,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:19:40,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:19:40,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:19:40,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:19:40,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:19:40,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:19:40,777 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:19:40,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:19:40,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:19:40,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:19:44,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:19:44,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:19:44,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:19:44,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:19:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:44,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:19:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:19:51,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:19:51,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2018-12-03 17:19:51,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:19:51,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:19:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:19:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 17:19:51,834 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2018-12-03 17:19:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:19:58,968 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 17:19:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:19:58,969 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2018-12-03 17:19:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:19:58,970 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:19:58,970 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:19:58,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 17:19:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:19:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-12-03 17:19:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:19:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 17:19:58,976 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 17:19:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:19:58,977 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 17:19:58,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:19:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 17:19:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:19:58,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:19:58,977 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 17:19:58,977 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:19:58,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:19:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 17:19:58,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:19:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:58,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:19:58,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:19:58,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:19:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:19:59,194 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:20:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:01,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:01,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:01,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:01,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:01,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:01,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:20:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:01,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:01,995 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:20:01,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:20:02,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:20:02,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:20:06,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:20:06,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:20:06,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:20:06,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:20:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:06,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:13,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:13,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2018-12-03 17:20:13,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:13,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:20:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:20:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:20:13,751 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2018-12-03 17:20:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:18,474 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 17:20:18,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:20:18,474 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2018-12-03 17:20:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:18,475 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:20:18,475 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:20:18,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:20:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:20:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-12-03 17:20:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:20:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 17:20:18,482 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 17:20:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:18,482 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 17:20:18,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:20:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 17:20:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:20:18,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:18,483 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 17:20:18,484 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:18,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 17:20:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:20:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:18,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:18,670 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:20:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:21,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:21,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:21,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:21,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:21,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:21,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:20:21,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:20:21,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 17:20:21,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:21,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:21,530 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:20:21,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:20:21,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:20:21,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:20:25,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:20:25,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:20:25,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:20:25,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:20:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:25,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:33,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:33,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2018-12-03 17:20:33,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:33,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 17:20:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 17:20:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 17:20:33,228 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2018-12-03 17:20:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:20:39,708 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 17:20:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:20:39,709 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2018-12-03 17:20:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:20:39,710 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:20:39,710 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:20:39,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 17:20:39,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:20:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 17:20:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:20:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:20:39,716 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 17:20:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:20:39,716 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:20:39,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 17:20:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:20:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:20:39,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:20:39,717 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 17:20:39,717 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:20:39,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:20:39,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 17:20:39,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:20:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:39,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:20:39,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:20:39,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:20:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:20:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:42,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:42,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:20:42,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:20:42,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:20:42,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:20:42,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:20:42,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:20:42,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:20:42,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:20:42,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:20:42,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:20:42,811 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:20:42,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:20:42,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:20:42,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:20:47,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:20:47,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:20:47,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:20:47,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:20:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:47,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:20:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:20:54,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:20:54,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2018-12-03 17:20:54,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:20:54,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-03 17:20:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-03 17:20:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:20:54,971 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2018-12-03 17:21:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:00,280 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 17:21:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:21:00,280 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2018-12-03 17:21:00,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:00,282 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:21:00,282 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:21:00,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:21:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:21:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-03 17:21:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:21:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:21:00,288 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 17:21:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:00,288 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:21:00,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-03 17:21:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:21:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:21:00,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:00,289 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 17:21:00,290 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:00,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 17:21:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:00,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:21:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:00,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:03,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:03,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:03,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:03,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:21:03,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:03,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:21:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:03,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:21:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:03,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:03,447 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:21:03,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:21:03,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:21:03,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:21:08,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:21:08,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:21:08,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:21:08,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:21:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:08,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:16,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:16,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2018-12-03 17:21:16,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:16,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-12-03 17:21:16,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-12-03 17:21:16,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 17:21:16,130 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2018-12-03 17:21:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:23,622 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 17:21:23,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:21:23,623 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2018-12-03 17:21:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:23,624 INFO L225 Difference]: With dead ends: 118 [2018-12-03 17:21:23,624 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:21:23,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 17:21:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:21:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-12-03 17:21:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:21:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 17:21:23,630 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 17:21:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:23,630 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 17:21:23,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-12-03 17:21:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 17:21:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:21:23,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:23,631 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 17:21:23,632 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:23,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 17:21:23,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:23,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:21:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:23,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:23,900 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:21:24,147 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:21:24,421 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:21:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:27,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:27,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:27,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:27,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:21:27,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:27,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:21:27,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:21:27,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:21:27,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 17:21:27,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:21:27,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:27,347 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:21:27,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:21:27,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:21:27,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:21:32,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:21:32,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:21:32,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:21:32,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:21:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:32,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:21:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:40,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:21:40,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2018-12-03 17:21:40,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:21:40,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 17:21:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 17:21:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:21:40,489 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2018-12-03 17:21:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:21:46,583 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-03 17:21:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:21:46,584 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2018-12-03 17:21:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:21:46,585 INFO L225 Difference]: With dead ends: 120 [2018-12-03 17:21:46,585 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 17:21:46,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:21:46,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 17:21:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-03 17:21:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:21:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 17:21:46,590 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 17:21:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:21:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 17:21:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 17:21:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 17:21:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 17:21:46,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:21:46,601 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 17:21:46,601 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:21:46,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:21:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 17:21:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:21:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:46,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:21:46,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:21:46,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:21:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:21:46,869 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:21:47,118 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:21:47,356 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:21:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:50,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:50,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:21:50,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:21:50,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:21:50,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:21:50,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:21:50,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:21:50,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:21:50,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:21:50,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:21:50,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:21:50,575 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:21:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:21:50,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:21:50,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:21:55,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:21:55,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:21:55,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:21:55,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:21:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:21:55,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:04,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2018-12-03 17:22:04,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:04,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-12-03 17:22:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-12-03 17:22:04,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 17:22:04,441 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2018-12-03 17:22:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:09,900 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-12-03 17:22:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:22:09,901 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2018-12-03 17:22:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:09,902 INFO L225 Difference]: With dead ends: 122 [2018-12-03 17:22:09,902 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 17:22:09,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 17:22:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 17:22:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 17:22:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 17:22:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 17:22:09,908 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 17:22:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:09,908 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 17:22:09,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-12-03 17:22:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 17:22:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 17:22:09,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:09,909 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 17:22:09,909 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:09,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 17:22:09,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:09,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:09,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:22:09,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:09,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:12,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:12,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:12,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:12,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:22:12,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:12,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:22:12,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:12,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:22:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:13,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:13,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:22:13,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:22:13,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:22:13,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:22:18,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:22:18,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:22:18,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:22:18,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:22:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:18,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:27,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:27,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2018-12-03 17:22:27,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:27,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-12-03 17:22:27,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-12-03 17:22:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:22:27,069 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2018-12-03 17:22:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:22:34,381 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-12-03 17:22:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:22:34,387 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2018-12-03 17:22:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:22:34,388 INFO L225 Difference]: With dead ends: 124 [2018-12-03 17:22:34,388 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 17:22:34,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:22:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 17:22:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-03 17:22:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 17:22:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 17:22:34,394 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 17:22:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:22:34,394 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 17:22:34,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-12-03 17:22:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 17:22:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 17:22:34,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:22:34,395 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 17:22:34,395 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:22:34,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:22:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 17:22:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:22:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:34,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:22:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:22:34,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:22:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:22:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:37,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:22:37,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:22:37,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:22:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:22:37,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:22:37,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:22:37,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:22:37,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 17:22:37,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:22:37,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:22:37,658 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:22:37,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:22:37,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:22:37,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:22:42,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:22:42,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:22:42,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:22:42,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:22:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:42,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:22:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:22:52,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:22:52,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2018-12-03 17:22:52,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:22:52,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 17:22:52,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 17:22:52,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 17:22:52,006 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2018-12-03 17:23:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:00,929 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-12-03 17:23:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:23:00,929 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2018-12-03 17:23:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:00,930 INFO L225 Difference]: With dead ends: 126 [2018-12-03 17:23:00,930 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:23:00,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 17:23:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:23:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-12-03 17:23:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:23:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 17:23:00,937 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 17:23:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:00,937 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 17:23:00,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 17:23:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 17:23:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:23:00,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:00,938 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 17:23:00,939 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:00,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:00,939 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 17:23:00,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:00,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:23:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:00,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:04,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:04,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:04,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:04,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:23:04,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:23:04,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:23:04,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:23:04,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:23:04,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:04,257 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:23:04,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:23:04,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:23:04,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:23:09,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:23:09,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:23:09,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:23:09,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:23:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:09,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:19,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2018-12-03 17:23:19,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:19,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-12-03 17:23:19,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-12-03 17:23:19,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:23:19,363 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2018-12-03 17:23:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:28,712 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-12-03 17:23:28,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:23:28,713 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2018-12-03 17:23:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:28,714 INFO L225 Difference]: With dead ends: 128 [2018-12-03 17:23:28,714 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 17:23:28,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:23:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 17:23:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-12-03 17:23:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 17:23:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 17:23:28,720 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 17:23:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:28,720 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 17:23:28,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-12-03 17:23:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 17:23:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 17:23:28,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:28,721 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 17:23:28,721 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:28,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 17:23:28,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:28,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:23:28,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:28,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:32,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:32,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:32,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:32,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:32,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:32,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:23:32,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:32,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:23:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:32,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:32,329 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:23:32,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:23:32,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:23:32,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:23:37,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:23:37,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:23:37,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:23:37,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:23:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:37,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:23:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:47,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:23:47,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2018-12-03 17:23:47,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:23:47,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-12-03 17:23:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-12-03 17:23:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 17:23:47,581 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2018-12-03 17:23:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:23:55,396 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-12-03 17:23:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:23:55,397 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2018-12-03 17:23:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:23:55,398 INFO L225 Difference]: With dead ends: 130 [2018-12-03 17:23:55,398 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 17:23:55,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 17:23:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 17:23:55,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 17:23:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 17:23:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 17:23:55,404 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 17:23:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:23:55,404 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 17:23:55,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-12-03 17:23:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 17:23:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 17:23:55,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:23:55,404 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 17:23:55,405 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:23:55,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:23:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 17:23:55,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:23:55,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:55,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:23:55,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:23:55,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:23:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:23:55,618 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 17:23:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:23:59,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:59,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:23:59,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:23:59,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:23:59,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:23:59,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:23:59,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:23:59,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:23:59,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 17:23:59,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:23:59,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:23:59,281 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:23:59,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:23:59,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:23:59,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:24:04,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:24:04,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:24:04,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:24:04,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:24:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:04,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:14,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:14,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2018-12-03 17:24:14,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:14,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 17:24:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 17:24:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:24:14,980 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2018-12-03 17:24:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:21,330 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-12-03 17:24:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:24:21,331 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2018-12-03 17:24:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:21,332 INFO L225 Difference]: With dead ends: 132 [2018-12-03 17:24:21,332 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 17:24:21,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:24:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 17:24:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-03 17:24:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 17:24:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 17:24:21,338 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 17:24:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:21,338 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 17:24:21,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 17:24:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 17:24:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 17:24:21,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:21,339 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 17:24:21,339 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:21,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 17:24:21,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:21,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:21,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:24:21,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:21,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:25,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:25,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:25,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:24:25,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:24:25,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:25,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:24:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:24:25,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:24:25,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:24:25,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:24:25,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:25,241 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:24:25,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:24:25,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:24:25,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:24:30,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:24:30,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:24:30,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:24:30,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:24:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:31,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:24:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:41,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:24:41,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2018-12-03 17:24:41,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:24:41,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-12-03 17:24:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-12-03 17:24:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 17:24:41,460 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2018-12-03 17:24:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:24:49,576 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-12-03 17:24:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:24:49,576 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2018-12-03 17:24:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:24:49,577 INFO L225 Difference]: With dead ends: 134 [2018-12-03 17:24:49,578 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 17:24:49,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 17:24:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 17:24:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-03 17:24:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 17:24:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 17:24:49,584 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 17:24:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:24:49,584 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 17:24:49,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-12-03 17:24:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 17:24:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 17:24:49,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:24:49,585 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 17:24:49,585 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:24:49,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:24:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 17:24:49,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:24:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:49,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:24:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:24:49,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:24:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:53,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:53,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:24:53,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:24:53,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:24:53,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:24:53,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:24:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:24:53,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:24:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:24:53,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:24:53,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:24:53,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:24:53,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:24:53,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:24:59,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:24:59,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:24:59,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:24:59,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:24:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:24:59,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:10,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:10,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2018-12-03 17:25:10,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:10,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-12-03 17:25:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-12-03 17:25:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:25:10,170 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2018-12-03 17:25:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:20,462 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-12-03 17:25:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:25:20,463 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2018-12-03 17:25:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:20,464 INFO L225 Difference]: With dead ends: 136 [2018-12-03 17:25:20,464 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 17:25:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:25:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 17:25:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-12-03 17:25:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 17:25:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 17:25:20,471 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 17:25:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:20,471 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 17:25:20,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-12-03 17:25:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 17:25:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 17:25:20,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:20,472 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 17:25:20,472 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:20,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 17:25:20,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:20,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:20,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:25:20,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:20,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:24,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:24,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:24,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:25:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:24,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:25:24,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:25:24,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:25:24,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 17:25:24,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:25:24,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:24,511 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:25:24,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:25:24,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:25:24,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:25:32,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:25:32,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:25:32,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:25:32,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:25:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:32,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:25:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:43,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:25:43,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2018-12-03 17:25:43,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:25:43,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 17:25:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 17:25:43,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 17:25:43,266 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2018-12-03 17:25:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:25:50,448 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-12-03 17:25:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:25:50,449 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2018-12-03 17:25:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:25:50,450 INFO L225 Difference]: With dead ends: 138 [2018-12-03 17:25:50,450 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 17:25:50,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 17:25:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 17:25:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 17:25:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:25:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 17:25:50,456 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 17:25:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:25:50,456 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 17:25:50,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 17:25:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 17:25:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 17:25:50,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:25:50,457 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 17:25:50,457 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:25:50,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:25:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 17:25:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:25:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:50,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:25:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:25:50,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:25:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:25:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:25:54,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:54,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:25:54,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:25:54,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:25:54,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:25:54,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:25:54,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:25:54,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:25:54,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:25:54,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:25:54,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:25:54,456 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 17:25:54,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:25:54,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:25:54,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 17:26:00,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 17:26:00,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 17:26:00,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 17:26:00,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 17:26:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:00,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:12,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2018-12-03 17:26:12,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:12,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-03 17:26:12,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-03 17:26:12,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:26:12,156 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states.