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_oct.epf -i ../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:11:25,158 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:11:25,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:11:25,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:11:25,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:11:25,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:11:25,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:11:25,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:11:25,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:11:25,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:11:25,179 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:11:25,179 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:11:25,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:11:25,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:11:25,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:11:25,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:11:25,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:11:25,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:11:25,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:11:25,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:11:25,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:11:25,193 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:11:25,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:11:25,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:11:25,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:11:25,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:11:25,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:11:25,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:11:25,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:11:25,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:11:25,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:11:25,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:11:25,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:11:25,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:11:25,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:11:25,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:11:25,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:11:25,218 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:11:25,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:11:25,219 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:11:25,220 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:11:25,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:11:25,220 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:11:25,220 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:11:25,220 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:11:25,221 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:11:25,221 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:11:25,221 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:11:25,221 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:11:25,221 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:11:25,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:11:25,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:11:25,223 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:11:25,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:11:25,225 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:11:25,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:11:25,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:11:25,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:11:25,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:11:25,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:11:25,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:11:25,226 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:11:25,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:11:25,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:11:25,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:11:25,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:11:25,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:11:25,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:11:25,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:11:25,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:11:25,229 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:11:25,229 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:11:25,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:11:25,229 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:11:25,229 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:11:25,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:11:25,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:11:25,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:11:25,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:11:25,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:11:25,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-02-15 11:11:25,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-02-15 11:11:25,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:11:25,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:11:25,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:11:25,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:11:25,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,370 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-15 11:11:25,371 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-15 11:11:25,371 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-15 11:11:25,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:11:25,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:11:25,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:11:25,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:11:25,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:11:25,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,480 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-15 11:11:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-15 11:11:25,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-15 11:11:25,696 INFO L278 CfgBuilder]: Using library mode [2019-02-15 11:11:25,696 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-15 11:11:25,697 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25 BoogieIcfgContainer [2019-02-15 11:11:25,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:11:25,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:11:25,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:11:25,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:11:25,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/2) ... [2019-02-15 11:11:25,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c56965 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:11:25, skipping insertion in model container [2019-02-15 11:11:25,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25" (2/2) ... [2019-02-15 11:11:25,706 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-02-15 11:11:25,716 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:11:25,724 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:11:25,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:11:25,777 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:11:25,777 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:11:25,777 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:11:25,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:11:25,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:11:25,778 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:11:25,778 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:11:25,778 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:11:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-15 11:11:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:11:25,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:25,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:11:25,803 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-02-15 11:11:25,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:25,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:25,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:25,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:25,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,361 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-02-15 11:11:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:26,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:11:26,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:11:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:11:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:26,455 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-15 11:11:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,576 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-15 11:11:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:11:26,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:11:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,598 INFO L225 Difference]: With dead ends: 14 [2019-02-15 11:11:26,598 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 11:11:26,602 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 [2019-02-15 11:11:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 11:11:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-15 11:11:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-15 11:11:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-15 11:11:26,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-02-15 11:11:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,642 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-15 11:11:26,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-15 11:11:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:11:26,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,643 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 11:11:26,643 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,644 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-02-15 11:11:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,813 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:11:27,171 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-15 11:11:27,433 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-15 11:11:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:27,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:27,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:27,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:11:27,439 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-02-15 11:11:27,489 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:27,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:28,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:11:28,126 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. [2019-02-15 11:11:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:28,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:11:28,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:28,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:28,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:28,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:28,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:28,291 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 [2019-02-15 11:11:28,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:28,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:28,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:28,428 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 [2019-02-15 11:11:28,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:28,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:28,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:28,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:28,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:28,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:11:28,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:28,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 11:11:28,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 11:11:28,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:11:28,650 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-02-15 11:11:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:28,918 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-15 11:11:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:11:28,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 11:11:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:28,920 INFO L225 Difference]: With dead ends: 10 [2019-02-15 11:11:28,920 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 11:11:28,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:11:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 11:11:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-15 11:11:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 11:11:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-15 11:11:28,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-15 11:11:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:28,925 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-15 11:11:28,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 11:11:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-15 11:11:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:11:28,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:28,926 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-02-15 11:11:28,926 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-02-15 11:11:28,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:28,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:29,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:29,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:29,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:29,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:29,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:29,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:29,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:29,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:11:29,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:29,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:29,346 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 [2019-02-15 11:11:29,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:29,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:29,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:29,489 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 [2019-02-15 11:11:29,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:29,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:29,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:29,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:29,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:11:29,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:29,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:11:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:11:29,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:11:29,711 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-02-15 11:11:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:29,785 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-15 11:11:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:11:29,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:11:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:29,787 INFO L225 Difference]: With dead ends: 12 [2019-02-15 11:11:29,787 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:11:29,787 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 [2019-02-15 11:11:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:11:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-15 11:11:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 11:11:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-15 11:11:29,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-02-15 11:11:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:29,791 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-15 11:11:29,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:11:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-15 11:11:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:11:29,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:29,792 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-02-15 11:11:29,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:29,793 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-02-15 11:11:29,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:29,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:29,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:29,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:30,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:30,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:30,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:30,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:30,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:30,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:30,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:30,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:30,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:30,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:30,137 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 [2019-02-15 11:11:30,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:30,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:30,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:30,385 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 [2019-02-15 11:11:30,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:30,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:30,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:30,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:30,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:30,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 11:11:30,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:30,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:11:30,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:11:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:11:30,609 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-02-15 11:11:30,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:30,749 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-15 11:11:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:11:30,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 11:11:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:30,751 INFO L225 Difference]: With dead ends: 14 [2019-02-15 11:11:30,751 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:11:30,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:11:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:11:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-15 11:11:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 11:11:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-15 11:11:30,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-15 11:11:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:30,755 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-15 11:11:30,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:11:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-15 11:11:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-15 11:11:30,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:30,755 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-02-15 11:11:30,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-02-15 11:11:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:30,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:31,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:31,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:31,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:31,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:31,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:31,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:31,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:31,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:31,188 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 [2019-02-15 11:11:31,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:31,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:31,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:31,437 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 [2019-02-15 11:11:31,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:31,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:31,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:31,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:31,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:31,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-02-15 11:11:31,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:31,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 11:11:31,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 11:11:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:31,608 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-02-15 11:11:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:31,722 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-15 11:11:31,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:11:31,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-02-15 11:11:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:31,724 INFO L225 Difference]: With dead ends: 16 [2019-02-15 11:11:31,724 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:11:31,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:11:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:11:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-15 11:11:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:11:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-15 11:11:31,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-02-15 11:11:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:31,728 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-15 11:11:31,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 11:11:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-15 11:11:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-15 11:11:31,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:31,729 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-02-15 11:11:31,729 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:31,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-02-15 11:11:31,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:31,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:31,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:32,049 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:11:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:32,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:32,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:32,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:32,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:32,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:32,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 11:11:32,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:32,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:32,271 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 [2019-02-15 11:11:32,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:32,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:32,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:32,437 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 [2019-02-15 11:11:32,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:32,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:32,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:32,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:32,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:32,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-02-15 11:11:32,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:32,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:11:32,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:11:32,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-15 11:11:32,783 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-02-15 11:11:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:32,907 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-15 11:11:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:11:32,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-02-15 11:11:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:32,908 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:11:32,909 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:11:32,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-15 11:11:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:11:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 11:11:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:11:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-15 11:11:32,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-02-15 11:11:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:32,913 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-15 11:11:32,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:11:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-15 11:11:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-15 11:11:32,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:32,914 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-02-15 11:11:32,914 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-02-15 11:11:32,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:32,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:33,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:33,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:33,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:33,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:33,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:33,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:33,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:33,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:33,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:33,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:11:33,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:33,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:33,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:33,495 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 [2019-02-15 11:11:33,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:33,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:33,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:33,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:33,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:33,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-02-15 11:11:33,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:33,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 11:11:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 11:11:33,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:11:33,799 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-02-15 11:11:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:34,133 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-15 11:11:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:11:34,133 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-02-15 11:11:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:34,134 INFO L225 Difference]: With dead ends: 20 [2019-02-15 11:11:34,134 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:11:34,134 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 [2019-02-15 11:11:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:11:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-02-15 11:11:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 11:11:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-15 11:11:34,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-02-15 11:11:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:34,138 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-15 11:11:34,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 11:11:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-15 11:11:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-15 11:11:34,139 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:34,139 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-02-15 11:11:34,140 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-02-15 11:11:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:34,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:34,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:34,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:34,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:34,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:34,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:34,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:34,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:34,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:34,550 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 [2019-02-15 11:11:34,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:34,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:34,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:34,755 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 [2019-02-15 11:11:34,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:34,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:34,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:34,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:35,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:35,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-02-15 11:11:35,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:35,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 11:11:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 11:11:35,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-15 11:11:35,134 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-02-15 11:11:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:35,553 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-15 11:11:35,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:11:35,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-02-15 11:11:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:35,554 INFO L225 Difference]: With dead ends: 22 [2019-02-15 11:11:35,554 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 11:11:35,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-15 11:11:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 11:11:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-15 11:11:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:11:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-15 11:11:35,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-02-15 11:11:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:35,559 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-15 11:11:35,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 11:11:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-15 11:11:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-15 11:11:35,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:35,560 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-02-15 11:11:35,561 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-02-15 11:11:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:35,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:35,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:35,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:35,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:35,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:35,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:35,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:36,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:36,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:36,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 11:11:36,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:36,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:36,025 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 [2019-02-15 11:11:36,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:36,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:36,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:36,224 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 [2019-02-15 11:11:36,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:36,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:36,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:36,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:36,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:36,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-02-15 11:11:36,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:36,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:11:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:11:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:11:36,698 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-02-15 11:11:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:37,079 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-15 11:11:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:11:37,081 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-02-15 11:11:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:37,081 INFO L225 Difference]: With dead ends: 24 [2019-02-15 11:11:37,082 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 11:11:37,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:11:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 11:11:37,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-15 11:11:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 11:11:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-15 11:11:37,087 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-02-15 11:11:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:37,087 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-15 11:11:37,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:11:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-15 11:11:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-15 11:11:37,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:37,088 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-02-15 11:11:37,088 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-02-15 11:11:37,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:37,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:37,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:37,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:37,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:37,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:37,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:37,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:37,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:37,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:37,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:37,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:37,497 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 [2019-02-15 11:11:37,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:37,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:37,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:37,791 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 [2019-02-15 11:11:37,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:37,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:37,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:37,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:38,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:38,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-02-15 11:11:38,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:38,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 11:11:38,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 11:11:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-15 11:11:38,208 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-02-15 11:11:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:38,487 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-15 11:11:38,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 11:11:38,488 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-02-15 11:11:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:38,489 INFO L225 Difference]: With dead ends: 26 [2019-02-15 11:11:38,489 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 11:11:38,490 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 [2019-02-15 11:11:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 11:11:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-15 11:11:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 11:11:38,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-15 11:11:38,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-02-15 11:11:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:38,495 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-15 11:11:38,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 11:11:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-15 11:11:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-15 11:11:38,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:38,496 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-02-15 11:11:38,496 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:38,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-02-15 11:11:38,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:38,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:38,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:38,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:39,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:39,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:39,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:39,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:39,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:39,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:39,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:39,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:39,026 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 [2019-02-15 11:11:39,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:39,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:39,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:39,507 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 [2019-02-15 11:11:39,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:39,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:39,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:39,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:40,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:40,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-02-15 11:11:40,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:40,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 11:11:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 11:11:40,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:11:40,098 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-02-15 11:11:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:40,390 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-15 11:11:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 11:11:40,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-02-15 11:11:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:40,392 INFO L225 Difference]: With dead ends: 28 [2019-02-15 11:11:40,392 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 11:11:40,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:11:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 11:11:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-15 11:11:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 11:11:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-15 11:11:40,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-02-15 11:11:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:40,398 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-15 11:11:40,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 11:11:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-15 11:11:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-15 11:11:40,398 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:40,398 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-02-15 11:11:40,399 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-02-15 11:11:40,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:40,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:40,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:40,672 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:11:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:41,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:41,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:41,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:41,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:41,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:41,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:41,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:41,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:41,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-15 11:11:41,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:41,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:41,033 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 [2019-02-15 11:11:41,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:41,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:41,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:41,379 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 [2019-02-15 11:11:41,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:41,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:41,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:41,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:42,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:42,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-02-15 11:11:42,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:42,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:11:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:11:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 11:11:42,063 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-02-15 11:11:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:42,406 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-15 11:11:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 11:11:42,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-02-15 11:11:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:42,408 INFO L225 Difference]: With dead ends: 30 [2019-02-15 11:11:42,408 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 11:11:42,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 11:11:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 11:11:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-15 11:11:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 11:11:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-15 11:11:42,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-02-15 11:11:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:42,414 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-15 11:11:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:11:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-15 11:11:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 11:11:42,417 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:42,417 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-02-15 11:11:42,417 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:42,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-02-15 11:11:42,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:42,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:42,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:42,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:42,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:42,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:42,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:42,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:42,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:42,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:42,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:42,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:42,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:42,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:42,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:42,937 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 [2019-02-15 11:11:42,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:42,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:42,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:43,268 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 [2019-02-15 11:11:43,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:43,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:43,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:43,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:43,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:43,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-02-15 11:11:43,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:43,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 11:11:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 11:11:43,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:11:43,869 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-02-15 11:11:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:44,483 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-15 11:11:44,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 11:11:44,484 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-02-15 11:11:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:44,484 INFO L225 Difference]: With dead ends: 32 [2019-02-15 11:11:44,485 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 11:11:44,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 11:11:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 11:11:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-15 11:11:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 11:11:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-15 11:11:44,490 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-02-15 11:11:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:44,490 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-15 11:11:44,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 11:11:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-15 11:11:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-15 11:11:44,491 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:44,491 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-02-15 11:11:44,491 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:44,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-02-15 11:11:44,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:44,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:44,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:44,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:45,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:45,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:45,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:45,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:45,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:45,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:45,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:45,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:45,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:45,339 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 [2019-02-15 11:11:45,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:45,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:45,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:45,777 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 [2019-02-15 11:11:45,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:45,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:45,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:45,808 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:45,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:46,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:46,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-02-15 11:11:46,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:46,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 11:11:46,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 11:11:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-15 11:11:46,447 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-02-15 11:11:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:47,188 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-15 11:11:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 11:11:47,189 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-02-15 11:11:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:47,190 INFO L225 Difference]: With dead ends: 34 [2019-02-15 11:11:47,190 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 11:11:47,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-15 11:11:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 11:11:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-02-15 11:11:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:11:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-15 11:11:47,197 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-02-15 11:11:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:47,197 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-15 11:11:47,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 11:11:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-15 11:11:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-15 11:11:47,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:47,198 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-02-15 11:11:47,199 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-02-15 11:11:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:47,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:47,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:47,438 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:11:47,679 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:11:48,530 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-15 11:11:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:48,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:48,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:48,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:48,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:48,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:48,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:11:48,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:11:48,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 11:11:48,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:48,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:48,585 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 [2019-02-15 11:11:48,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:48,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:48,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:48,999 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 [2019-02-15 11:11:49,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:49,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:49,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:49,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:50,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:50,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-02-15 11:11:50,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:50,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 11:11:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 11:11:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:11:50,249 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-02-15 11:11:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:50,891 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-15 11:11:50,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 11:11:50,892 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-02-15 11:11:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:50,893 INFO L225 Difference]: With dead ends: 36 [2019-02-15 11:11:50,893 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 11:11:50,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 11:11:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 11:11:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-15 11:11:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 11:11:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-15 11:11:50,900 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-02-15 11:11:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:50,900 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-15 11:11:50,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 11:11:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-15 11:11:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-15 11:11:50,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:50,901 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-02-15 11:11:50,901 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-02-15 11:11:50,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:50,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:50,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:51,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:51,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:51,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:51,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:51,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:51,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:11:51,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:11:51,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:11:51,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:11:51,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:11:51,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:51,596 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 [2019-02-15 11:11:51,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:51,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:51,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:52,070 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 [2019-02-15 11:11:52,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:52,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:52,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:52,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:53,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:53,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-02-15 11:11:53,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:53,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 11:11:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 11:11:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-15 11:11:53,924 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-02-15 11:11:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:54,517 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-15 11:11:54,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 11:11:54,518 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-02-15 11:11:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:54,518 INFO L225 Difference]: With dead ends: 38 [2019-02-15 11:11:54,518 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 11:11:54,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-15 11:11:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 11:11:54,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-02-15 11:11:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 11:11:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-15 11:11:54,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-02-15 11:11:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:54,525 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-15 11:11:54,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 11:11:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-15 11:11:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-15 11:11:54,526 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:54,526 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-02-15 11:11:54,526 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-02-15 11:11:54,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:54,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:54,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:11:54,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:54,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:54,758 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:11:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:55,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:55,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:55,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:11:55,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:11:55,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:55,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:11:55,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:55,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:55,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:55,286 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 [2019-02-15 11:11:55,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:55,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:55,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:11:55,823 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 [2019-02-15 11:11:55,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:55,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:55,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:11:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:55,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:56,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:56,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-02-15 11:11:56,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:56,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 11:11:56,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 11:11:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:11:56,759 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-02-15 11:11:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:57,667 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-15 11:11:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 11:11:57,667 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-02-15 11:11:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:57,668 INFO L225 Difference]: With dead ends: 40 [2019-02-15 11:11:57,669 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 11:11:57,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:11:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 11:11:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-15 11:11:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:11:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-15 11:11:57,676 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-02-15 11:11:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:57,676 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-15 11:11:57,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 11:11:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-15 11:11:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-15 11:11:57,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:57,677 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-02-15 11:11:57,677 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-02-15 11:11:57,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:57,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:57,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:57,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:57,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:57,947 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:11:58,205 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:11:58,475 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:11:58,793 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:11:59,132 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:11:59,497 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:12:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:00,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:00,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:00,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:00,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:00,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:00,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:00,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:00,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:00,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 11:12:00,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:00,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:00,182 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 [2019-02-15 11:12:00,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:00,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:00,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:00,801 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 [2019-02-15 11:12:00,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:00,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:00,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:00,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:01,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-02-15 11:12:01,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:01,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 11:12:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 11:12:01,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-15 11:12:01,900 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-02-15 11:12:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:02,742 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-15 11:12:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 11:12:02,742 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-02-15 11:12:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:02,743 INFO L225 Difference]: With dead ends: 42 [2019-02-15 11:12:02,743 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 11:12:02,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-15 11:12:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 11:12:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-15 11:12:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 11:12:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-15 11:12:02,750 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-02-15 11:12:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:02,751 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-15 11:12:02,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 11:12:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-15 11:12:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-15 11:12:02,751 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:02,752 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-02-15 11:12:02,752 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:02,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-02-15 11:12:02,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:03,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:03,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:03,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:03,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:03,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:03,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:03,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:03,636 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 [2019-02-15 11:12:03,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:03,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:03,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:04,262 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 [2019-02-15 11:12:04,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:04,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:04,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:05,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:05,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-02-15 11:12:05,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:05,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 11:12:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 11:12:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:05,560 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-02-15 11:12:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:06,594 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-15 11:12:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 11:12:06,594 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-02-15 11:12:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:06,595 INFO L225 Difference]: With dead ends: 44 [2019-02-15 11:12:06,595 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 11:12:06,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 11:12:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-02-15 11:12:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 11:12:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-15 11:12:06,602 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-02-15 11:12:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:06,602 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-15 11:12:06,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 11:12:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-15 11:12:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-15 11:12:06,603 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:06,603 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-02-15 11:12:06,603 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-02-15 11:12:06,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:06,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:06,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:06,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:06,841 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:12:07,077 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:12:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:07,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:07,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:07,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:07,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:07,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:07,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:07,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:07,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:07,880 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 [2019-02-15 11:12:07,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:07,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:07,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:08,585 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 [2019-02-15 11:12:08,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:08,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:08,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:09,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:09,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-02-15 11:12:09,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:09,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 11:12:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 11:12:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-15 11:12:09,910 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-02-15 11:12:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:10,814 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-15 11:12:10,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 11:12:10,814 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-02-15 11:12:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:10,815 INFO L225 Difference]: With dead ends: 46 [2019-02-15 11:12:10,815 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 11:12:10,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-15 11:12:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 11:12:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-02-15 11:12:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-15 11:12:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-15 11:12:10,822 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-02-15 11:12:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:10,823 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-15 11:12:10,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 11:12:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-15 11:12:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-15 11:12:10,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:10,824 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-02-15 11:12:10,824 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:10,824 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-02-15 11:12:10,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:10,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:10,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:11,021 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:12:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:11,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:11,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:11,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:11,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:11,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:11,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:11,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:11,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-15 11:12:11,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:11,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:11,719 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 [2019-02-15 11:12:11,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:11,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:11,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:12,504 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 [2019-02-15 11:12:12,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:12,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:12,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:12,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:13,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:13,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-02-15 11:12:13,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:13,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:12:13,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:12:13,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:13,820 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-02-15 11:12:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:14,702 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-15 11:12:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 11:12:14,702 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-02-15 11:12:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:14,703 INFO L225 Difference]: With dead ends: 48 [2019-02-15 11:12:14,703 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 11:12:14,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 11:12:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-15 11:12:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 11:12:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-15 11:12:14,710 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-02-15 11:12:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:14,710 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-15 11:12:14,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:12:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-15 11:12:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-15 11:12:14,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:14,711 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-02-15 11:12:14,711 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-02-15 11:12:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:15,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:15,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:15,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:15,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:15,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:15,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:15,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:15,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:15,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:15,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:15,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:15,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 [2019-02-15 11:12:15,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:15,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:15,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:16,310 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 [2019-02-15 11:12:16,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:16,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:16,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:16,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:17,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-02-15 11:12:17,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:17,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 11:12:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 11:12:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-15 11:12:17,746 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-02-15 11:12:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:18,845 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-15 11:12:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 11:12:18,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-02-15 11:12:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:18,849 INFO L225 Difference]: With dead ends: 50 [2019-02-15 11:12:18,849 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 11:12:18,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-15 11:12:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 11:12:18,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-02-15 11:12:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 11:12:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-15 11:12:18,855 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-02-15 11:12:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:18,856 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-15 11:12:18,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 11:12:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-15 11:12:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-15 11:12:18,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:18,857 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-02-15 11:12:18,857 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-02-15 11:12:18,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:18,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:18,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:19,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:19,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:19,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:19,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:19,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:19,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:19,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:19,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:19,721 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 [2019-02-15 11:12:19,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:19,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:19,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:20,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 [2019-02-15 11:12:20,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:20,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:20,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:20,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:22,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:22,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-02-15 11:12:22,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:22,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 11:12:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 11:12:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:12:22,435 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-02-15 11:12:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:23,585 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-15 11:12:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 11:12:23,585 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-02-15 11:12:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:23,586 INFO L225 Difference]: With dead ends: 52 [2019-02-15 11:12:23,586 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 11:12:23,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 11:12:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 11:12:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-02-15 11:12:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 11:12:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-15 11:12:23,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-02-15 11:12:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:23,593 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-15 11:12:23,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 11:12:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-15 11:12:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-15 11:12:23,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:23,594 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-02-15 11:12:23,594 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-02-15 11:12:23,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:23,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:23,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:23,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:24,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:24,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:24,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:24,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:24,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:24,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:24,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:24,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:24,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 11:12:24,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:24,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:24,492 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 [2019-02-15 11:12:24,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:24,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:24,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:25,688 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 [2019-02-15 11:12:25,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:25,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:25,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:25,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-02-15 11:12:27,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:27,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:12:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:12:27,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-15 11:12:27,303 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-02-15 11:12:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:28,767 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-15 11:12:28,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 11:12:28,768 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-02-15 11:12:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:28,769 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:12:28,769 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 11:12:28,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-15 11:12:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 11:12:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-15 11:12:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 11:12:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-15 11:12:28,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-02-15 11:12:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:28,776 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-15 11:12:28,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:12:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-15 11:12:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 11:12:28,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:28,777 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-02-15 11:12:28,777 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-02-15 11:12:28,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:28,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:28,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:28,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:28,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:29,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:29,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:29,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:29,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:29,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:29,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:29,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:29,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:29,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:29,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:29,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:29,810 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 [2019-02-15 11:12:29,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:29,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:29,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:30,956 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 [2019-02-15 11:12:30,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:30,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:30,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:30,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:33,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:33,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-02-15 11:12:33,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:33,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 11:12:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 11:12:33,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:12:33,176 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-02-15 11:12:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:34,412 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-15 11:12:34,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 11:12:34,414 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-02-15 11:12:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:34,414 INFO L225 Difference]: With dead ends: 56 [2019-02-15 11:12:34,414 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:12:34,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 11:12:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:12:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-02-15 11:12:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 11:12:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-15 11:12:34,419 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-02-15 11:12:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:34,419 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-15 11:12:34,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 11:12:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-15 11:12:34,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-15 11:12:34,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:34,420 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-02-15 11:12:34,421 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-02-15 11:12:34,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:34,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:34,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:34,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:34,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:35,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:35,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:35,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:35,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:35,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:35,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:35,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:35,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:35,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:35,520 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 [2019-02-15 11:12:35,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:35,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:35,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:36,656 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 [2019-02-15 11:12:36,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:36,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:36,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:36,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:38,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:38,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-02-15 11:12:38,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:38,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-15 11:12:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-15 11:12:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-15 11:12:38,610 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-02-15 11:12:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:39,904 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-15 11:12:39,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 11:12:39,904 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-02-15 11:12:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:39,904 INFO L225 Difference]: With dead ends: 58 [2019-02-15 11:12:39,905 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 11:12:39,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-15 11:12:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 11:12:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-02-15 11:12:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 11:12:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-15 11:12:39,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-02-15 11:12:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:39,910 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-15 11:12:39,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-15 11:12:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-15 11:12:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-15 11:12:39,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:39,911 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-02-15 11:12:39,912 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-02-15 11:12:39,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:39,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:39,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:41,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:41,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:41,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:41,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:41,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:41,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:41,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:41,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:41,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 11:12:41,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:41,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:41,219 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 [2019-02-15 11:12:41,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:41,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:41,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:42,370 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 [2019-02-15 11:12:42,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:42,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:42,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:42,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:44,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-02-15 11:12:44,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:44,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 11:12:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 11:12:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:12:44,358 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-02-15 11:12:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:46,336 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-15 11:12:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 11:12:46,336 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-02-15 11:12:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:46,337 INFO L225 Difference]: With dead ends: 60 [2019-02-15 11:12:46,337 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 11:12:46,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 11:12:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 11:12:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-15 11:12:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 11:12:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-15 11:12:46,343 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-02-15 11:12:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:46,343 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-15 11:12:46,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 11:12:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-15 11:12:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-15 11:12:46,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:46,344 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-02-15 11:12:46,344 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:46,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-02-15 11:12:46,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:46,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:46,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:46,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:47,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:47,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:47,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:47,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:47,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:47,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:47,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:47,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:47,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:47,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:47,423 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 [2019-02-15 11:12:47,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:47,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:47,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:48,644 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 [2019-02-15 11:12:48,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:48,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:48,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:48,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:51,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:51,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-02-15 11:12:51,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:51,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-15 11:12:51,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-15 11:12:51,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-15 11:12:51,092 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-02-15 11:12:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:52,601 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-15 11:12:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 11:12:52,601 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-02-15 11:12:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:52,602 INFO L225 Difference]: With dead ends: 62 [2019-02-15 11:12:52,602 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:12:52,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-15 11:12:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:12:52,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-02-15 11:12:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-15 11:12:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-15 11:12:52,607 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-02-15 11:12:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:52,608 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-15 11:12:52,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-15 11:12:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-15 11:12:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-15 11:12:52,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:52,609 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-02-15 11:12:52,610 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-02-15 11:12:52,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:52,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:52,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:52,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:52,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:52,869 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:12:53,084 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:12:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:54,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:54,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:54,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:54,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:54,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:54,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:12:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:54,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:54,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:54,116 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 [2019-02-15 11:12:54,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:54,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:54,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:12:55,396 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 [2019-02-15 11:12:55,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:12:55,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:12:55,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:12:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:55,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-02-15 11:12:57,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:57,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-15 11:12:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-15 11:12:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:12:57,875 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-02-15 11:12:59,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:59,394 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-15 11:12:59,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 11:12:59,394 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-02-15 11:12:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:59,395 INFO L225 Difference]: With dead ends: 64 [2019-02-15 11:12:59,395 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 11:12:59,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:12:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 11:12:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-02-15 11:12:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-15 11:12:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-15 11:12:59,402 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-02-15 11:12:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:59,402 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-15 11:12:59,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-15 11:12:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-15 11:12:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-15 11:12:59,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:59,403 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-02-15 11:12:59,403 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-02-15 11:12:59,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:59,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:59,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:59,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:00,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:00,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:00,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:00,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:00,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:00,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:00,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:00,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:00,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-15 11:13:00,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:00,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:00,617 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 [2019-02-15 11:13:00,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:00,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:00,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:02,328 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 [2019-02-15 11:13:02,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:02,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:02,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:02,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:04,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:04,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-02-15 11:13:04,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:04,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 11:13:04,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 11:13:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-15 11:13:04,762 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-02-15 11:13:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:06,841 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-15 11:13:06,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 11:13:06,842 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-02-15 11:13:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:06,843 INFO L225 Difference]: With dead ends: 66 [2019-02-15 11:13:06,843 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:13:06,844 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 [2019-02-15 11:13:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:13:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-15 11:13:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 11:13:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-15 11:13:06,848 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-02-15 11:13:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:06,848 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-15 11:13:06,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 11:13:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-15 11:13:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-15 11:13:06,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:06,849 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-02-15 11:13:06,849 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-02-15 11:13:06,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:06,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:06,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:06,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:07,045 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:13:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:08,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:08,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:08,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:08,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:08,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:08,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:08,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:08,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:08,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:08,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:08,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:08,175 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 [2019-02-15 11:13:08,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:08,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:08,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:09,621 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 [2019-02-15 11:13:09,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:09,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:09,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:09,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:12,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-02-15 11:13:12,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:12,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-15 11:13:12,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-15 11:13:12,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:13:12,459 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-02-15 11:13:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:14,165 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-15 11:13:14,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 11:13:14,165 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-02-15 11:13:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:14,166 INFO L225 Difference]: With dead ends: 68 [2019-02-15 11:13:14,166 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 11:13:14,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 11:13:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 11:13:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-02-15 11:13:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 11:13:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-15 11:13:14,172 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-02-15 11:13:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:14,172 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-15 11:13:14,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-15 11:13:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-15 11:13:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-15 11:13:14,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:14,173 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-02-15 11:13:14,173 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-02-15 11:13:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:14,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:14,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:14,407 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:13:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:15,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:15,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:15,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:15,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:15,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:15,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:15,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:15,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:15,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:15,537 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 [2019-02-15 11:13:15,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:15,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:15,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:17,258 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 [2019-02-15 11:13:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:17,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:17,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:17,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:19,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:19,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-02-15 11:13:19,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:19,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-15 11:13:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-15 11:13:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-15 11:13:19,967 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-02-15 11:13:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:22,063 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-15 11:13:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 11:13:22,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-02-15 11:13:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:22,065 INFO L225 Difference]: With dead ends: 70 [2019-02-15 11:13:22,065 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 11:13:22,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-15 11:13:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 11:13:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-02-15 11:13:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 11:13:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-15 11:13:22,070 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-02-15 11:13:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:22,071 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-15 11:13:22,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-15 11:13:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-15 11:13:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-15 11:13:22,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:22,071 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-02-15 11:13:22,072 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-02-15 11:13:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:22,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:22,251 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:13:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:23,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:23,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:23,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:23,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:23,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:23,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:23,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:23,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:23,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-15 11:13:23,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:23,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:23,496 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 [2019-02-15 11:13:23,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:23,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:23,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:25,151 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 [2019-02-15 11:13:25,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:25,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:25,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:25,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-02-15 11:13:28,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:28,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 11:13:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 11:13:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:13:28,289 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-02-15 11:13:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:31,053 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-15 11:13:31,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 11:13:31,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-02-15 11:13:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:31,054 INFO L225 Difference]: With dead ends: 72 [2019-02-15 11:13:31,055 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:13:31,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:13:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:13:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-15 11:13:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-15 11:13:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-15 11:13:31,059 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-02-15 11:13:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:31,060 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-15 11:13:31,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 11:13:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-15 11:13:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-15 11:13:31,060 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:31,060 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-02-15 11:13:31,061 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-02-15 11:13:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:31,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:31,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:31,316 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:13:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:32,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:32,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:32,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:32,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:32,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:32,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:32,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:32,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:32,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:32,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:32,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:32,784 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 [2019-02-15 11:13:32,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:32,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:32,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:34,526 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 [2019-02-15 11:13:34,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:34,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:34,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:34,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:37,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:37,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-02-15 11:13:37,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:37,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-15 11:13:37,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-15 11:13:37,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-15 11:13:37,856 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-02-15 11:13:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:40,166 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-15 11:13:40,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 11:13:40,167 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-02-15 11:13:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:40,168 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:13:40,168 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 11:13:40,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-15 11:13:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 11:13:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-02-15 11:13:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-15 11:13:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-15 11:13:40,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-02-15 11:13:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:40,172 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-15 11:13:40,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-15 11:13:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-15 11:13:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-15 11:13:40,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:40,173 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-02-15 11:13:40,173 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-02-15 11:13:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:40,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:40,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:40,423 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:13:40,650 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:13:40,898 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:13:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:42,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:42,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:42,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:42,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:42,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:42,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:42,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:42,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:42,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:42,436 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 [2019-02-15 11:13:42,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:42,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:42,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:44,269 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 [2019-02-15 11:13:44,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:44,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:44,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:44,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-02-15 11:13:47,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:47,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 11:13:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 11:13:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:13:47,734 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-02-15 11:13:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:50,230 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-15 11:13:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 11:13:50,236 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-02-15 11:13:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:50,237 INFO L225 Difference]: With dead ends: 76 [2019-02-15 11:13:50,237 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 11:13:50,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 11:13:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 11:13:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-02-15 11:13:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 11:13:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-15 11:13:50,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-02-15 11:13:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:50,242 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-15 11:13:50,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 11:13:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-15 11:13:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-15 11:13:50,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:50,243 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-02-15 11:13:50,243 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:50,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-02-15 11:13:50,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:50,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:50,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:50,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:50,507 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:13:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:51,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:51,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:51,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:51,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:51,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:51,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:13:51,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:51,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:52,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-15 11:13:52,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:52,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:52,092 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 [2019-02-15 11:13:52,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:52,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:52,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:13:54,119 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 [2019-02-15 11:13:54,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:13:54,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:13:54,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:13:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:54,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:57,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-02-15 11:13:57,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:57,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 11:13:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 11:13:57,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-15 11:13:57,752 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-02-15 11:14:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:00,800 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-15 11:14:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 11:14:00,801 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-02-15 11:14:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:00,802 INFO L225 Difference]: With dead ends: 78 [2019-02-15 11:14:00,802 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:14:00,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-15 11:14:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:14:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-15 11:14:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 11:14:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-15 11:14:00,807 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-02-15 11:14:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:00,807 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-15 11:14:00,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 11:14:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-15 11:14:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-15 11:14:00,808 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:00,808 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-02-15 11:14:00,808 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-02-15 11:14:00,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:00,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:00,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:00,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:02,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:02,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:02,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:02,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:02,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:02,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:14:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:02,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:02,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:02,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:02,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:02,581 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 [2019-02-15 11:14:02,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:02,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:02,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:14:04,642 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 [2019-02-15 11:14:04,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:04,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:04,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:14:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:04,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:08,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:08,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-02-15 11:14:08,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:08,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-15 11:14:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-15 11:14:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:14:08,490 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-02-15 11:14:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:11,441 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-15 11:14:11,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 11:14:11,442 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-02-15 11:14:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:11,443 INFO L225 Difference]: With dead ends: 80 [2019-02-15 11:14:11,443 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 11:14:11,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:14:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 11:14:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-02-15 11:14:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 11:14:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-15 11:14:11,448 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-02-15 11:14:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:11,448 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-15 11:14:11,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-15 11:14:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-15 11:14:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-15 11:14:11,449 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:11,449 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-02-15 11:14:11,449 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-02-15 11:14:11,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:11,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:11,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:11,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:11,735 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:14:11,947 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:14:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:13,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:13,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:13,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:13,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:13,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:13,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:14:13,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:13,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:13,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:13,728 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 [2019-02-15 11:14:13,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:13,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:13,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:14:15,862 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 [2019-02-15 11:14:15,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:15,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:15,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:14:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:15,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:19,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:19,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-02-15 11:14:19,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:19,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-15 11:14:19,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-15 11:14:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-15 11:14:19,903 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-02-15 11:14:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:22,677 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-15 11:14:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 11:14:22,677 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-02-15 11:14:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:22,678 INFO L225 Difference]: With dead ends: 82 [2019-02-15 11:14:22,679 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 11:14:22,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-15 11:14:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 11:14:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-02-15 11:14:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 11:14:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-15 11:14:22,683 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-02-15 11:14:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:22,683 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-15 11:14:22,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-15 11:14:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-15 11:14:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-15 11:14:22,684 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:22,684 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-02-15 11:14:22,684 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:22,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-02-15 11:14:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:22,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:22,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:22,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:24,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:24,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:24,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:24,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:24,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:24,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:14:24,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:24,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:24,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-15 11:14:24,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:24,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:24,656 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 [2019-02-15 11:14:24,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:24,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:24,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:14:26,882 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 [2019-02-15 11:14:26,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:26,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:26,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:14:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:26,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:31,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:31,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-02-15 11:14:31,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:31,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 11:14:31,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 11:14:31,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:14:31,088 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-02-15 11:14:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:34,781 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-15 11:14:34,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 11:14:34,782 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-02-15 11:14:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:34,783 INFO L225 Difference]: With dead ends: 84 [2019-02-15 11:14:34,783 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 11:14:34,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 11:14:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 11:14:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-15 11:14:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-15 11:14:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-15 11:14:34,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-02-15 11:14:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:34,787 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-15 11:14:34,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 11:14:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-15 11:14:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-15 11:14:34,788 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:34,788 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-02-15 11:14:34,788 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-02-15 11:14:34,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:34,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:34,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:34,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:35,066 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:14:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:36,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:36,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:36,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:36,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:36,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:36,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:14:36,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:36,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:36,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:36,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:36,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:36,781 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 [2019-02-15 11:14:36,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:36,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:36,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:14:39,374 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 [2019-02-15 11:14:39,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:39,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:39,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:14:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:39,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:43,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:43,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-02-15 11:14:43,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:43,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-15 11:14:43,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-15 11:14:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-15 11:14:43,802 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-02-15 11:14:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:46,726 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-15 11:14:46,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 11:14:46,727 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-02-15 11:14:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:46,728 INFO L225 Difference]: With dead ends: 86 [2019-02-15 11:14:46,728 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:14:46,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-15 11:14:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:14:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-02-15 11:14:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 11:14:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-15 11:14:46,734 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-02-15 11:14:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:46,734 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-15 11:14:46,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-15 11:14:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-15 11:14:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-15 11:14:46,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:46,735 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-02-15 11:14:46,735 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-02-15 11:14:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:46,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:46,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:48,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:48,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:48,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:48,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:48,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:48,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:14:48,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:48,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:48,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:48,994 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 [2019-02-15 11:14:48,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:48,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:48,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:14:51,449 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 [2019-02-15 11:14:51,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:14:51,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:14:51,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:14:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:51,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:56,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:56,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-02-15 11:14:56,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:56,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-15 11:14:56,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-15 11:14:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:14:56,074 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-02-15 11:15:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:00,232 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-15 11:15:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 11:15:00,232 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-02-15 11:15:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:00,233 INFO L225 Difference]: With dead ends: 88 [2019-02-15 11:15:00,234 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 11:15:00,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:15:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 11:15:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-02-15 11:15:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-15 11:15:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-15 11:15:00,240 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-02-15 11:15:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:00,240 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-15 11:15:00,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-15 11:15:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-15 11:15:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-15 11:15:00,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:00,241 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-02-15 11:15:00,242 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-02-15 11:15:00,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:00,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:00,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:00,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:00,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:02,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:02,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:02,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:02,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:02,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:15:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:02,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:02,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-15 11:15:02,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:02,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:02,167 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 [2019-02-15 11:15:02,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:02,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:02,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:15:05,074 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 [2019-02-15 11:15:05,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:05,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:05,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:15:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:05,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:09,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:09,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-02-15 11:15:09,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:09,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 11:15:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 11:15:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-15 11:15:09,948 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-02-15 11:15:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:14,662 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-15 11:15:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 11:15:14,662 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-02-15 11:15:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:14,663 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:15:14,664 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:15:14,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-15 11:15:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:15:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-15 11:15:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-15 11:15:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-15 11:15:14,668 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-02-15 11:15:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:14,669 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-15 11:15:14,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 11:15:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-15 11:15:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-15 11:15:14,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:14,669 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-02-15 11:15:14,669 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-02-15 11:15:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:14,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:14,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:14,907 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:15:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:16,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:16,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:16,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:16,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:16,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:16,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:15:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:16,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:16,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:16,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:16,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:16,707 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 [2019-02-15 11:15:16,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:16,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:16,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:15:19,732 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 [2019-02-15 11:15:19,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:19,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:19,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:15:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:19,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:24,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:24,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-02-15 11:15:24,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:24,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 11:15:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 11:15:24,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:15:24,810 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-02-15 11:15:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:29,548 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-15 11:15:29,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 11:15:29,549 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-02-15 11:15:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:29,549 INFO L225 Difference]: With dead ends: 92 [2019-02-15 11:15:29,549 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 11:15:29,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 11:15:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 11:15:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-02-15 11:15:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-15 11:15:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-15 11:15:29,555 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-02-15 11:15:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:29,555 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-15 11:15:29,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 11:15:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-15 11:15:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-15 11:15:29,556 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:29,556 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-02-15 11:15:29,556 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-02-15 11:15:29,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:29,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:29,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:29,797 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:15:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:31,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:31,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:31,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:31,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:31,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:31,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:15:31,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:31,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:31,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:31,745 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 [2019-02-15 11:15:31,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:31,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:31,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:15:34,613 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 [2019-02-15 11:15:34,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:34,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:34,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:15:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:34,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-02-15 11:15:39,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:39,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-15 11:15:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-15 11:15:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-15 11:15:39,855 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-02-15 11:15:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:43,664 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-15 11:15:43,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 11:15:43,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-02-15 11:15:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:43,666 INFO L225 Difference]: With dead ends: 94 [2019-02-15 11:15:43,666 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 11:15:43,667 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 [2019-02-15 11:15:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 11:15:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-02-15 11:15:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 11:15:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-15 11:15:43,671 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-02-15 11:15:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:43,671 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-15 11:15:43,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-15 11:15:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-15 11:15:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-15 11:15:43,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:43,672 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-02-15 11:15:43,672 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-02-15 11:15:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:43,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:43,897 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:15:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:46,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:46,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:46,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:46,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:46,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:46,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:15:46,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:46,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:46,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-15 11:15:46,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:46,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:46,190 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 [2019-02-15 11:15:46,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:46,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:46,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:15:49,610 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 [2019-02-15 11:15:49,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:15:49,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:15:49,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:15:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:49,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:55,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:55,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-02-15 11:15:55,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:55,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 11:15:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 11:15:55,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:55,257 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-02-15 11:15:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:59,465 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-15 11:15:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 11:15:59,466 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-02-15 11:15:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:59,467 INFO L225 Difference]: With dead ends: 96 [2019-02-15 11:15:59,467 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 11:15:59,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:15:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 11:15:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-15 11:15:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-15 11:15:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-15 11:15:59,472 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-02-15 11:15:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:59,472 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-15 11:15:59,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 11:15:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-15 11:15:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-15 11:15:59,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:59,473 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-02-15 11:15:59,473 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-02-15 11:15:59,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:59,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:59,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:59,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:59,696 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:16:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:01,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:01,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:01,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:01,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:01,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:01,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:16:01,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:01,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:02,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:02,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:02,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:02,017 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 [2019-02-15 11:16:02,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:02,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:02,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:16:05,094 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 [2019-02-15 11:16:05,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:05,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:05,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:16:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:05,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:11,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:11,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-02-15 11:16:11,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:11,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-15 11:16:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-15 11:16:11,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-15 11:16:11,030 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-02-15 11:16:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:15,724 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-15 11:16:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 11:16:15,724 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-02-15 11:16:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:15,725 INFO L225 Difference]: With dead ends: 98 [2019-02-15 11:16:15,725 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 11:16:15,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-15 11:16:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 11:16:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-02-15 11:16:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 11:16:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-15 11:16:15,730 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-02-15 11:16:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:15,730 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-15 11:16:15,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-15 11:16:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-15 11:16:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-15 11:16:15,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:15,731 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-02-15 11:16:15,731 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:15,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-02-15 11:16:15,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:15,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:15,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:15,998 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:16:16,238 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:16:16,493 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:16:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:18,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:18,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:18,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:18,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:18,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:18,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:16:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:18,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:16:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:18,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:18,652 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 [2019-02-15 11:16:18,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:18,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:18,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:16:22,041 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 [2019-02-15 11:16:22,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:22,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:22,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:16:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:22,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:27,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:27,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-02-15 11:16:27,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:27,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-15 11:16:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-15 11:16:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:16:27,876 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-02-15 11:16:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:32,303 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-15 11:16:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 11:16:32,304 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-02-15 11:16:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:32,305 INFO L225 Difference]: With dead ends: 100 [2019-02-15 11:16:32,305 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 11:16:32,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 11:16:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 11:16:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-02-15 11:16:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 11:16:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-15 11:16:32,310 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-02-15 11:16:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:32,311 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-15 11:16:32,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-15 11:16:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-15 11:16:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-15 11:16:32,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:32,311 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-02-15 11:16:32,311 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:32,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-02-15 11:16:32,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:32,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:32,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:32,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:34,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:34,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:34,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:34,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:34,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:34,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:16:34,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:34,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:34,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-15 11:16:34,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:34,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:34,698 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 [2019-02-15 11:16:34,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:34,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:34,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:16:38,878 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 [2019-02-15 11:16:38,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:38,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:38,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:16:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:38,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:44,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-02-15 11:16:44,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:44,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 11:16:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 11:16:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-15 11:16:44,972 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-02-15 11:16:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:49,380 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-15 11:16:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 11:16:49,381 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-02-15 11:16:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:49,382 INFO L225 Difference]: With dead ends: 102 [2019-02-15 11:16:49,382 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 11:16:49,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-15 11:16:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 11:16:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-15 11:16:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 11:16:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-15 11:16:49,388 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-02-15 11:16:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:49,388 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-15 11:16:49,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 11:16:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-15 11:16:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-15 11:16:49,389 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:49,389 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-02-15 11:16:49,390 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:49,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-02-15 11:16:49,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:49,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:49,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:49,652 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:16:49,890 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:16:50,079 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:16:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:52,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:52,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:52,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:52,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:52,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:52,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:16:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:52,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:52,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:52,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:52,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:52,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 [2019-02-15 11:16:52,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:52,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:52,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:16:56,080 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 [2019-02-15 11:16:56,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:16:56,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:16:56,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:16:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:56,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:02,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:02,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-02-15 11:17:02,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:02,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-15 11:17:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-15 11:17:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:17:02,646 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-02-15 11:17:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:07,224 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-15 11:17:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 11:17:07,224 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-02-15 11:17:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:07,225 INFO L225 Difference]: With dead ends: 104 [2019-02-15 11:17:07,225 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:17:07,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 11:17:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:17:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-02-15 11:17:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-15 11:17:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-15 11:17:07,232 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-02-15 11:17:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:07,232 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-15 11:17:07,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-15 11:17:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-15 11:17:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-15 11:17:07,233 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:07,233 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-02-15 11:17:07,233 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-02-15 11:17:07,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:07,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:07,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:09,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:09,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:09,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:09,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:09,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:09,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:17:09,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:09,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:17:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:09,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:09,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 [2019-02-15 11:17:09,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:09,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:09,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:17:13,466 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 [2019-02-15 11:17:13,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:13,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:13,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:17:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:13,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:20,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-02-15 11:17:20,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:20,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-15 11:17:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-15 11:17:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 11:17:20,119 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-02-15 11:17:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:25,053 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-15 11:17:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 11:17:25,054 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-02-15 11:17:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:25,055 INFO L225 Difference]: With dead ends: 106 [2019-02-15 11:17:25,055 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 11:17:25,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 11:17:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 11:17:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-02-15 11:17:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-15 11:17:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-15 11:17:25,062 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-02-15 11:17:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:25,062 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-15 11:17:25,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-15 11:17:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-15 11:17:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-15 11:17:25,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:25,063 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-02-15 11:17:25,063 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-02-15 11:17:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:25,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:25,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:25,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:25,348 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:17:25,554 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:17:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:28,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:28,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:28,203 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:28,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:28,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:28,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:17:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:28,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:28,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-15 11:17:28,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:28,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:28,336 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 [2019-02-15 11:17:28,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:28,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:28,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:17:32,034 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 [2019-02-15 11:17:32,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:32,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:32,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:17:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:32,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:39,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:39,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-02-15 11:17:39,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:39,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 11:17:39,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 11:17:39,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:17:39,261 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-02-15 11:17:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:45,577 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-15 11:17:45,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 11:17:45,577 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-02-15 11:17:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:45,579 INFO L225 Difference]: With dead ends: 108 [2019-02-15 11:17:45,579 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 11:17:45,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 11:17:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 11:17:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-15 11:17:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-15 11:17:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-15 11:17:45,586 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-02-15 11:17:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:45,587 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-15 11:17:45,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 11:17:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-15 11:17:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-15 11:17:45,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:45,587 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-02-15 11:17:45,588 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-02-15 11:17:45,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:45,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:45,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:45,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:45,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:48,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:48,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:48,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:48,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:48,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:48,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:17:48,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:48,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:48,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:48,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:48,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:48,413 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 [2019-02-15 11:17:48,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:48,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:48,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:17:52,311 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 [2019-02-15 11:17:52,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:17:52,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:17:52,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:17:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:52,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:59,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:59,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-02-15 11:17:59,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:59,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-15 11:17:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-15 11:17:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 11:17:59,643 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-02-15 11:18:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:06,881 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-15 11:18:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 11:18:06,881 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-02-15 11:18:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:06,883 INFO L225 Difference]: With dead ends: 110 [2019-02-15 11:18:06,883 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 11:18:06,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 11:18:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 11:18:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-02-15 11:18:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 11:18:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-15 11:18:06,890 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-02-15 11:18:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:06,890 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-15 11:18:06,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-15 11:18:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-15 11:18:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-15 11:18:06,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:06,891 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-02-15 11:18:06,892 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-02-15 11:18:06,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:06,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:06,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:09,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:09,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:09,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:09,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:09,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:09,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:18:09,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:09,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:09,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:09,839 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 [2019-02-15 11:18:09,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:09,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:09,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:18:14,221 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 [2019-02-15 11:18:14,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:14,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:14,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:18:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:14,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:21,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:21,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-02-15 11:18:21,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:21,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-15 11:18:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-15 11:18:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:18:21,840 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-02-15 11:18:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:26,794 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-15 11:18:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 11:18:26,794 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-02-15 11:18:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:26,795 INFO L225 Difference]: With dead ends: 112 [2019-02-15 11:18:26,796 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 11:18:26,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 11:18:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 11:18:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-02-15 11:18:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-15 11:18:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-15 11:18:26,801 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-02-15 11:18:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:26,801 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-15 11:18:26,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-15 11:18:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-15 11:18:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-15 11:18:26,802 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:26,802 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-02-15 11:18:26,802 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-02-15 11:18:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:26,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:26,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:26,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:27,111 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:18:27,376 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:18:27,660 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:18:27,966 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:18:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:30,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:30,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:30,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:30,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:30,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:30,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:18:30,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:18:30,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:18:30,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-15 11:18:30,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:30,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:30,938 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 [2019-02-15 11:18:30,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:30,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:30,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:18:35,377 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 [2019-02-15 11:18:35,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:35,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:35,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:18:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:35,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-02-15 11:18:42,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:42,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 11:18:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 11:18:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 11:18:42,939 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-02-15 11:18:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:49,808 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-15 11:18:49,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 11:18:49,808 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-02-15 11:18:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:49,809 INFO L225 Difference]: With dead ends: 114 [2019-02-15 11:18:49,809 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 11:18:49,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 11:18:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 11:18:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-15 11:18:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 11:18:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-15 11:18:49,816 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-02-15 11:18:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:49,816 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-15 11:18:49,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 11:18:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-15 11:18:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-15 11:18:49,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:49,817 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-02-15 11:18:49,817 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-02-15 11:18:49,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:49,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:49,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:50,077 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:18:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:52,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:52,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:52,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:52,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:18:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:18:52,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:18:52,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:18:52,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:52,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:52,887 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 [2019-02-15 11:18:52,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:52,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:52,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:18:57,419 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 [2019-02-15 11:18:57,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:18:57,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:18:57,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:18:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:57,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:05,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:05,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-02-15 11:19:05,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:05,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-02-15 11:19:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-02-15 11:19:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 11:19:05,341 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-02-15 11:19:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:10,965 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-15 11:19:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 11:19:10,965 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-02-15 11:19:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:10,967 INFO L225 Difference]: With dead ends: 116 [2019-02-15 11:19:10,967 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 11:19:10,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 11:19:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 11:19:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-02-15 11:19:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-15 11:19:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-15 11:19:10,973 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-02-15 11:19:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:10,974 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-15 11:19:10,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-02-15 11:19:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-15 11:19:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-15 11:19:10,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:10,975 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-02-15 11:19:10,975 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-02-15 11:19:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:10,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:10,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:11,249 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:19:11,480 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:19:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:14,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:14,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:14,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:14,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:14,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:14,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:19:14,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:14,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:19:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:14,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:14,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 11:19:14,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:14,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:14,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:19:19,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 [2019-02-15 11:19:19,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:19,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:19,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:19:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:19,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:27,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:27,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-02-15 11:19:27,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-02-15 11:19:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-02-15 11:19:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 11:19:27,397 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-02-15 11:19:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:35,051 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-02-15 11:19:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 11:19:35,052 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-02-15 11:19:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:35,053 INFO L225 Difference]: With dead ends: 118 [2019-02-15 11:19:35,053 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 11:19:35,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 11:19:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 11:19:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-02-15 11:19:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-15 11:19:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-15 11:19:35,060 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-02-15 11:19:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:35,060 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-15 11:19:35,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-02-15 11:19:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-15 11:19:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-15 11:19:35,061 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:35,061 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-02-15 11:19:35,061 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-02-15 11:19:35,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:35,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:35,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:35,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:35,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:38,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:38,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:38,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:38,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:38,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:38,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:19:38,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:38,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:38,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-15 11:19:38,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:38,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:38,202 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 [2019-02-15 11:19:38,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:38,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:38,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:19:43,058 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 [2019-02-15 11:19:43,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:19:43,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:19:43,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:19:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:43,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:51,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:51,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-02-15 11:19:51,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:51,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 11:19:51,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 11:19:51,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 11:19:51,490 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-02-15 11:19:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:57,760 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-15 11:19:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 11:19:57,760 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-02-15 11:19:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:57,762 INFO L225 Difference]: With dead ends: 120 [2019-02-15 11:19:57,762 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 11:19:57,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 11:19:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 11:19:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-15 11:19:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-15 11:19:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-15 11:19:57,768 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-02-15 11:19:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:57,768 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-15 11:19:57,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 11:19:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-15 11:19:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-15 11:19:57,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:57,769 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-02-15 11:19:57,769 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:57,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:57,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-02-15 11:19:57,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:57,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:57,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:57,998 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:20:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:01,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:01,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:01,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:01,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:01,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:01,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:20:01,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:20:01,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:20:01,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:20:01,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:01,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:01,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 [2019-02-15 11:20:01,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:01,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:01,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:20:06,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 [2019-02-15 11:20:06,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:06,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:06,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:20:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:06,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:15,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:15,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-02-15 11:20:15,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:15,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-02-15 11:20:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-02-15 11:20:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 11:20:15,222 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-02-15 11:20:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:20,841 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-02-15 11:20:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 11:20:20,842 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-02-15 11:20:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:20,843 INFO L225 Difference]: With dead ends: 122 [2019-02-15 11:20:20,843 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 11:20:20,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 11:20:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 11:20:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-02-15 11:20:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-02-15 11:20:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-02-15 11:20:20,849 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-02-15 11:20:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:20,850 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-02-15 11:20:20,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-02-15 11:20:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-02-15 11:20:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-02-15 11:20:20,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:20,851 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-02-15 11:20:20,851 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-02-15 11:20:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:20,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:20,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:21,115 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:20:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:24,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:24,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:24,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:24,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:24,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:24,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:20:24,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:24,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:20:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:24,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:24,331 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 [2019-02-15 11:20:24,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:24,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:24,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:20:29,269 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 [2019-02-15 11:20:29,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:29,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:29,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:20:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:29,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:38,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:38,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-02-15 11:20:38,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-02-15 11:20:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-02-15 11:20:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:20:38,320 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-02-15 11:20:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:45,901 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-02-15 11:20:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 11:20:45,902 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-02-15 11:20:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:45,904 INFO L225 Difference]: With dead ends: 124 [2019-02-15 11:20:45,904 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 11:20:45,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:20:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 11:20:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-02-15 11:20:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-15 11:20:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-15 11:20:45,910 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-02-15 11:20:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:45,911 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-15 11:20:45,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-02-15 11:20:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-15 11:20:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-15 11:20:45,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:45,912 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-02-15 11:20:45,912 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-02-15 11:20:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:45,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:20:45,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:45,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:49,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:49,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:49,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:49,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:49,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:49,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:20:49,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:20:49,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:20:49,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-15 11:20:49,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:49,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:49,404 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 [2019-02-15 11:20:49,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:49,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:49,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:20:54,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 [2019-02-15 11:20:54,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:20:54,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:20:54,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:20:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:54,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:03,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:03,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-02-15 11:21:03,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:03,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-15 11:21:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-15 11:21:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 11:21:03,893 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-02-15 11:21:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:13,197 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-15 11:21:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 11:21:13,197 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-02-15 11:21:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:13,198 INFO L225 Difference]: With dead ends: 126 [2019-02-15 11:21:13,199 INFO L226 Difference]: Without dead ends: 125 [2019-02-15 11:21:13,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 11:21:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-15 11:21:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-15 11:21:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-15 11:21:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-15 11:21:13,206 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-02-15 11:21:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:13,206 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-15 11:21:13,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-15 11:21:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-15 11:21:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-15 11:21:13,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:13,207 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-02-15 11:21:13,207 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-02-15 11:21:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:13,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:13,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:13,503 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:21:13,771 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:21:14,054 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 11:21:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:17,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:17,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:17,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:17,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:17,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:17,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:21:17,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:21:17,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:21:17,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:21:17,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:17,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:17,319 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 [2019-02-15 11:21:17,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:17,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:17,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:21:22,728 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 [2019-02-15 11:21:22,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:22,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:22,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:21:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:22,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:32,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-02-15 11:21:32,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:32,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-02-15 11:21:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-02-15 11:21:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:21:32,259 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-02-15 11:21:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:41,825 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-02-15 11:21:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 11:21:41,825 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-02-15 11:21:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:41,826 INFO L225 Difference]: With dead ends: 128 [2019-02-15 11:21:41,826 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 11:21:41,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 11:21:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 11:21:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-02-15 11:21:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-15 11:21:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-15 11:21:41,833 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-02-15 11:21:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:41,833 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-15 11:21:41,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-02-15 11:21:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-15 11:21:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-15 11:21:41,834 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:41,834 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-02-15 11:21:41,835 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-02-15 11:21:41,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:41,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:41,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:45,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:45,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:45,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:45,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:45,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:45,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:21:45,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:45,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:21:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:45,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:45,450 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 [2019-02-15 11:21:45,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:45,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:45,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:21:50,953 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 [2019-02-15 11:21:50,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:21:50,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:21:50,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:21:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:51,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:00,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:00,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-02-15 11:22:00,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:00,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-02-15 11:22:00,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-02-15 11:22:00,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 11:22:00,996 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-02-15 11:22:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:09,365 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-15 11:22:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 11:22:09,366 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-02-15 11:22:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:09,367 INFO L225 Difference]: With dead ends: 130 [2019-02-15 11:22:09,367 INFO L226 Difference]: Without dead ends: 129 [2019-02-15 11:22:09,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 11:22:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-15 11:22:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-02-15 11:22:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-15 11:22:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-02-15 11:22:09,372 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-02-15 11:22:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:09,372 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-02-15 11:22:09,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-02-15 11:22:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-02-15 11:22:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-02-15 11:22:09,373 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:09,373 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-02-15 11:22:09,373 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-02-15 11:22:09,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:09,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:09,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:09,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:09,640 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 11:22:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:12,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:12,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:12,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:12,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:12,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:12,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:22:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:22:12,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:22:13,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-15 11:22:13,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:13,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:13,121 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 [2019-02-15 11:22:13,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:22:13,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:22:13,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:22:18,859 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 [2019-02-15 11:22:18,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:22:18,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:22:18,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:22:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:19,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:29,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:29,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-02-15 11:22:29,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:29,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-15 11:22:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-15 11:22:29,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 11:22:29,047 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-02-15 11:22:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:35,851 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-15 11:22:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 11:22:35,852 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-02-15 11:22:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:35,853 INFO L225 Difference]: With dead ends: 132 [2019-02-15 11:22:35,853 INFO L226 Difference]: Without dead ends: 131 [2019-02-15 11:22:35,854 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 [2019-02-15 11:22:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-15 11:22:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-15 11:22:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-15 11:22:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-15 11:22:35,859 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-02-15 11:22:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-15 11:22:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-15 11:22:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-15 11:22:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-15 11:22:35,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:35,860 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-02-15 11:22:35,860 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-02-15 11:22:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:35,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:35,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:39,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:39,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:39,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:39,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:39,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:39,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:22:39,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:22:39,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:22:39,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:22:39,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:39,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:39,502 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 [2019-02-15 11:22:39,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:22:39,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:22:39,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:22:45,491 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 [2019-02-15 11:22:45,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:22:45,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:22:45,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:22:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:45,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:56,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:56,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-02-15 11:22:56,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:56,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-02-15 11:22:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-02-15 11:22:56,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 11:22:56,003 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-02-15 11:23:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:04,373 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-02-15 11:23:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 11:23:04,373 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-02-15 11:23:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:04,374 INFO L225 Difference]: With dead ends: 134 [2019-02-15 11:23:04,375 INFO L226 Difference]: Without dead ends: 133 [2019-02-15 11:23:04,377 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 [2019-02-15 11:23:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-15 11:23:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-02-15 11:23:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 11:23:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-15 11:23:04,382 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-02-15 11:23:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:04,383 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-15 11:23:04,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-02-15 11:23:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-15 11:23:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-15 11:23:04,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:04,384 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-02-15 11:23:04,384 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-02-15 11:23:04,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:04,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:04,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:08,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:08,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:08,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:08,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:23:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:08,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:23:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:08,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:08,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 [2019-02-15 11:23:08,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:08,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:08,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:23:14,445 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 [2019-02-15 11:23:14,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:14,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:14,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:23:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:14,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:25,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:25,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-02-15 11:23:25,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:25,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-02-15 11:23:25,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-02-15 11:23:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 11:23:25,353 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-02-15 11:23:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:36,153 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-15 11:23:36,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 11:23:36,153 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-02-15 11:23:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:36,154 INFO L225 Difference]: With dead ends: 136 [2019-02-15 11:23:36,154 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 11:23:36,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 11:23:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 11:23:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-02-15 11:23:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 11:23:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-02-15 11:23:36,161 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-02-15 11:23:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:36,162 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-02-15 11:23:36,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-02-15 11:23:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-02-15 11:23:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-02-15 11:23:36,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:36,162 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-02-15 11:23:36,163 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:36,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-02-15 11:23:36,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:36,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:23:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:36,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:23:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:39,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:39,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:23:39,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:23:39,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:23:39,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:23:39,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:23:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:23:39,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:23:39,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-15 11:23:39,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:23:39,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:39,968 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 [2019-02-15 11:23:39,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:40,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:40,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:23:47,105 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 [2019-02-15 11:23:47,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:23:47,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:23:47,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:23:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:47,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-02-15 11:23:58,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:58,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-15 11:23:58,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-15 11:23:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-15 11:23:58,505 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-02-15 11:24:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:05,896 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-15 11:24:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 11:24:05,897 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-02-15 11:24:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:05,898 INFO L225 Difference]: With dead ends: 138 [2019-02-15 11:24:05,898 INFO L226 Difference]: Without dead ends: 137 [2019-02-15 11:24:05,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-15 11:24:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-15 11:24:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-15 11:24:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-15 11:24:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-15 11:24:05,905 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-02-15 11:24:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:05,905 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-15 11:24:05,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-15 11:24:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-15 11:24:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-15 11:24:05,906 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:05,906 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-02-15 11:24:05,906 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-02-15 11:24:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:05,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:24:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:05,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:09,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:09,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:09,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:24:09,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:24:09,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:09,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-02-15 11:24:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:24:09,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:24:10,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:24:10,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:24:10,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:10,041 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 [2019-02-15 11:24:10,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:10,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:10,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 11:24:16,584 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 [2019-02-15 11:24:16,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:24:16,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:24:16,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 11:24:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:16,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:28,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:24:28,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-02-15 11:24:28,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:24:28,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-15 11:24:28,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-15 11:24:28,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 11:24:28,318 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states.