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/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:55:37,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:55:37,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:55:37,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:55:37,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:55:37,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:55:37,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:55:37,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:55:37,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:55:37,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:55:37,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:55:37,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:55:37,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:55:37,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:55:37,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:55:37,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:55:37,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:55:37,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:55:37,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:55:37,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:55:37,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:55:37,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:55:37,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:55:37,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:55:37,189 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:55:37,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:55:37,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:55:37,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:55:37,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:55:37,195 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:55:37,195 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:55:37,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:55:37,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:55:37,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:55:37,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:55:37,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:55:37,198 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-01-07 21:55:37,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:55:37,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:55:37,214 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:55:37,214 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:55:37,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:55:37,214 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:55:37,214 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:55:37,215 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:55:37,215 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:55:37,215 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 21:55:37,215 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 21:55:37,216 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:55:37,216 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:55:37,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:55:37,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:55:37,217 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:55:37,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:55:37,218 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:55:37,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:55:37,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:55:37,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:55:37,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:55:37,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:55:37,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:55:37,219 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:55:37,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:55:37,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:55:37,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:55:37,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:55:37,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:55:37,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:55:37,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:55:37,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:55:37,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:55:37,221 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:55:37,221 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:55:37,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:55:37,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:55:37,222 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:55:37,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:55:37,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:55:37,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:55:37,286 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:55:37,287 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:55:37,288 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-07 21:55:37,288 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-07 21:55:37,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:55:37,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:55:37,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:55:37,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:55:37,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:55:37,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:55:37,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:55:37,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:55:37,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:55:37,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:55:37,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:55:37,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:55:37,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:55:37,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (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-01-07 21:55:37,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:55:37,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:55:37,733 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:55:37,734 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-07 21:55:37,735 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:55:37 BoogieIcfgContainer [2019-01-07 21:55:37,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:55:37,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:55:37,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:55:37,742 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:55:37,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/2) ... [2019-01-07 21:55:37,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676eeb62 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:55:37, skipping insertion in model container [2019-01-07 21:55:37,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:55:37" (2/2) ... [2019-01-07 21:55:37,748 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-07 21:55:37,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:55:37,767 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 21:55:37,786 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 21:55:37,823 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:55:37,824 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:55:37,824 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:55:37,824 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:55:37,824 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:55:37,825 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:55:37,825 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:55:37,825 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:55:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-07 21:55:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:55:37,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:37,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:55:37,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-07 21:55:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:37,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:37,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:38,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:55:38,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:55:38,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:55:38,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:55:38,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:55:38,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:55:38,027 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-07 21:55:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:38,102 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 21:55:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:55:38,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 21:55:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:38,116 INFO L225 Difference]: With dead ends: 12 [2019-01-07 21:55:38,117 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 21:55:38,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:55:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 21:55:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 21:55:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 21:55:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-07 21:55:38,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-07 21:55:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:38,161 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-07 21:55:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:55:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 21:55:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:55:38,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:38,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:55:38,162 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-07 21:55:38,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:38,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:38,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:38,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:38,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:55:38,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:38,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:38,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:55:38,326 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-07 21:55:38,444 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 21:55:38,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:55:41,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:55:41,089 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:55:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:41,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:55:41,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,097 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-01-07 21:55:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:41,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:41,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:55:41,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:55:41,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:41,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-07 21:55:41,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:41,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:55:41,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:55:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 21:55:41,420 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-07 21:55:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:41,487 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-07 21:55:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:55:41,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-07 21:55:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:41,489 INFO L225 Difference]: With dead ends: 13 [2019-01-07 21:55:41,489 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 21:55:41,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 21:55:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 21:55:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 21:55:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 21:55:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-07 21:55:41,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-07 21:55:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:41,493 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-07 21:55:41,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:55:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 21:55:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:55:41,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:41,495 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-07 21:55:41,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:41,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-07 21:55:41,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:41,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:41,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:41,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:55:41,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:41,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:41,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:41,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,669 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-01-07 21:55:41,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:41,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:41,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:55:41,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:41,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:55:41,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:55:41,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:41,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-07 21:55:41,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:41,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 21:55:41,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 21:55:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:55:41,931 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-07 21:55:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:42,114 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-07 21:55:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:55:42,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-07 21:55:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:42,115 INFO L225 Difference]: With dead ends: 16 [2019-01-07 21:55:42,116 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 21:55:42,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:55:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 21:55:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 21:55:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 21:55:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-07 21:55:42,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-07 21:55:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:42,119 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-07 21:55:42,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 21:55:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 21:55:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:55:42,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:42,120 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-07 21:55:42,120 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:42,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-07 21:55:42,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:42,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:42,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 21:55:42,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:42,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:42,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:42,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,256 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-01-07 21:55:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:42,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:42,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:42,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:42,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 21:55:42,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 21:55:42,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:42,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-07 21:55:42,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:42,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:55:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:55:42,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:55:42,543 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-07 21:55:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:42,691 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-07 21:55:42,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:55:42,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-07 21:55:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:42,693 INFO L225 Difference]: With dead ends: 19 [2019-01-07 21:55:42,693 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 21:55:42,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:55:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 21:55:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-07 21:55:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 21:55:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-07 21:55:42,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-07 21:55:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:42,698 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-07 21:55:42,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:55:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 21:55:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-07 21:55:42,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:42,699 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-07 21:55:42,699 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-07 21:55:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:42,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:42,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 21:55:42,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:42,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:42,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:42,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,770 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-01-07 21:55:42,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:42,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:42,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 21:55:42,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 21:55:42,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:42,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-07 21:55:42,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:42,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:55:42,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:55:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:55:42,966 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-07 21:55:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:43,028 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-07 21:55:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:55:43,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-07 21:55:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:43,031 INFO L225 Difference]: With dead ends: 22 [2019-01-07 21:55:43,031 INFO L226 Difference]: Without dead ends: 15 [2019-01-07 21:55:43,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:55:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-07 21:55:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-07 21:55:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 21:55:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-07 21:55:43,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-07 21:55:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:43,036 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-07 21:55:43,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:55:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 21:55:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-07 21:55:43,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:43,037 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-07 21:55:43,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-07 21:55:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:43,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-07 21:55:43,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:43,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:43,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:43,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:43,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:43,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 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-01-07 21:55:43,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:43,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:43,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:55:43,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:43,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-07 21:55:43,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-07 21:55:43,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:43,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-07 21:55:43,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:43,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:55:43,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:55:43,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:55:43,984 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-07 21:55:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:44,056 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-07 21:55:44,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:55:44,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-07 21:55:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:44,058 INFO L225 Difference]: With dead ends: 25 [2019-01-07 21:55:44,058 INFO L226 Difference]: Without dead ends: 17 [2019-01-07 21:55:44,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:55:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-07 21:55:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-07 21:55:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:55:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-07 21:55:44,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-07 21:55:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:44,062 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-07 21:55:44,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:55:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-07 21:55:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-07 21:55:44,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:44,063 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-07 21:55:44,064 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:44,064 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-07 21:55:44,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 21:55:44,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:44,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:44,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:44,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:44,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:44,194 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-01-07 21:55:44,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:44,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:44,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:44,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:44,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 21:55:44,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 21:55:44,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:44,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-07 21:55:44,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:44,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:55:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:55:44,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:55:44,731 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-07 21:55:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:44,928 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-07 21:55:44,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:55:44,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-07 21:55:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:44,929 INFO L225 Difference]: With dead ends: 28 [2019-01-07 21:55:44,929 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 21:55:44,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:55:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 21:55:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-07 21:55:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 21:55:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-07 21:55:44,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-07 21:55:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:44,934 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-07 21:55:44,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:55:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-07 21:55:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-07 21:55:44,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:44,935 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-07 21:55:44,935 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-07 21:55:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-07 21:55:45,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:45,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:45,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:45,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:45,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:45,094 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-01-07 21:55:45,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:45,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:45,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-07 21:55:45,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-07 21:55:45,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:45,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-07 21:55:45,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:45,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:55:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:55:45,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:55:45,314 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-07 21:55:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:45,381 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-07 21:55:45,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:55:45,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-07 21:55:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:45,385 INFO L225 Difference]: With dead ends: 31 [2019-01-07 21:55:45,385 INFO L226 Difference]: Without dead ends: 21 [2019-01-07 21:55:45,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:55:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-07 21:55:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-07 21:55:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 21:55:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-07 21:55:45,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-07 21:55:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:45,390 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-07 21:55:45,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:55:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-07 21:55:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 21:55:45,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:45,391 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-07 21:55:45,391 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:45,392 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-07 21:55:45,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:45,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:45,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:45,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:45,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-07 21:55:45,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:45,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:45,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:45,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:45,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:45,522 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-01-07 21:55:45,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:45,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:45,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-07 21:55:45,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:45,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-07 21:55:45,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-07 21:55:46,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-07 21:55:46,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:46,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:55:46,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:55:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:55:46,297 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-07 21:55:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:46,479 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-07 21:55:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:55:46,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-07 21:55:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:46,481 INFO L225 Difference]: With dead ends: 34 [2019-01-07 21:55:46,481 INFO L226 Difference]: Without dead ends: 23 [2019-01-07 21:55:46,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:55:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-07 21:55:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-07 21:55:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 21:55:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-07 21:55:46,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-07 21:55:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:46,488 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-07 21:55:46,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:55:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-07 21:55:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-07 21:55:46,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:46,489 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-07 21:55:46,489 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-07 21:55:46,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:46,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:46,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-07 21:55:46,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:46,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:46,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:46,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:46,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:46,736 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-01-07 21:55:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:46,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:46,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:46,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:46,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-07 21:55:46,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-07 21:55:47,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:47,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-07 21:55:47,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:47,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:55:47,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:55:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:55:47,029 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-07 21:55:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:47,094 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-07 21:55:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:55:47,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-07 21:55:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:47,102 INFO L225 Difference]: With dead ends: 37 [2019-01-07 21:55:47,102 INFO L226 Difference]: Without dead ends: 25 [2019-01-07 21:55:47,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:55:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-07 21:55:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-07 21:55:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 21:55:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-07 21:55:47,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-07 21:55:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:47,110 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-07 21:55:47,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:55:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-07 21:55:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-07 21:55:47,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:47,116 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-07 21:55:47,116 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:47,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-07 21:55:47,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:47,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:47,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:47,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-07 21:55:47,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:47,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:47,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:47,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:47,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:47,424 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-01-07 21:55:47,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:47,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:47,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-07 21:55:47,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-07 21:55:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:47,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-07 21:55:47,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:47,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:55:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:55:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:55:47,892 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-07 21:55:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:48,030 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-07 21:55:48,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 21:55:48,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-07 21:55:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:48,032 INFO L225 Difference]: With dead ends: 40 [2019-01-07 21:55:48,032 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 21:55:48,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:55:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 21:55:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-07 21:55:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-07 21:55:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-07 21:55:48,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-07 21:55:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:48,037 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-07 21:55:48,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:55:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-07 21:55:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-07 21:55:48,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:48,039 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-07 21:55:48,039 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-07 21:55:48,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:48,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:48,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-07 21:55:48,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:48,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:48,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:48,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:48,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:48,420 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-01-07 21:55:48,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:48,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:48,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-07 21:55:48,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:48,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-07 21:55:48,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-07 21:55:48,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:48,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-07 21:55:48,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:48,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:55:48,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:55:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:55:48,787 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-07 21:55:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:48,864 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-07 21:55:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 21:55:48,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-07 21:55:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:48,866 INFO L225 Difference]: With dead ends: 43 [2019-01-07 21:55:48,866 INFO L226 Difference]: Without dead ends: 29 [2019-01-07 21:55:48,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:55:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-07 21:55:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-07 21:55:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:55:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-07 21:55:48,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-07 21:55:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:48,873 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-07 21:55:48,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:55:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-07 21:55:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-07 21:55:48,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:48,875 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-07 21:55:48,875 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-07 21:55:48,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:48,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:48,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-07 21:55:49,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:49,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:49,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:49,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:49,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:49,060 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-01-07 21:55:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:49,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:49,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:49,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:49,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-07 21:55:49,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-07 21:55:49,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-07 21:55:49,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-07 21:55:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-07 21:55:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-07 21:55:49,464 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-07 21:55:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:49,563 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-07 21:55:49,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 21:55:49,564 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-07 21:55:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:49,565 INFO L225 Difference]: With dead ends: 46 [2019-01-07 21:55:49,565 INFO L226 Difference]: Without dead ends: 31 [2019-01-07 21:55:49,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-07 21:55:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-07 21:55:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-07 21:55:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:55:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-07 21:55:49,571 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-07 21:55:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:49,572 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-07 21:55:49,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-07 21:55:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-07 21:55:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-07 21:55:49,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:49,573 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-07 21:55:49,573 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-07 21:55:49,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:49,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:49,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-07 21:55:49,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:49,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:49,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:49,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:49,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:49,756 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-01-07 21:55:49,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:49,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:49,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-07 21:55:49,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-07 21:55:50,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:50,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-07 21:55:50,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:50,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 21:55:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 21:55:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-07 21:55:50,266 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-07 21:55:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:50,334 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-07 21:55:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 21:55:50,335 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-07 21:55:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:50,336 INFO L225 Difference]: With dead ends: 49 [2019-01-07 21:55:50,336 INFO L226 Difference]: Without dead ends: 33 [2019-01-07 21:55:50,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-07 21:55:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-07 21:55:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-07 21:55:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-07 21:55:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-07 21:55:50,343 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-07 21:55:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:50,344 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-07 21:55:50,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 21:55:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-07 21:55:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-07 21:55:50,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:50,345 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-07 21:55:50,345 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-07 21:55:50,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:50,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:50,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:50,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:50,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-07 21:55:50,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:50,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:50,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:50,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:50,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:50,644 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-01-07 21:55:50,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:50,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:50,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-07 21:55:50,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:50,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-07 21:55:50,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-07 21:55:51,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:51,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-07 21:55:51,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:51,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-07 21:55:51,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-07 21:55:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:55:51,069 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-07 21:55:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:51,176 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-07 21:55:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-07 21:55:51,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-07 21:55:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:51,177 INFO L225 Difference]: With dead ends: 52 [2019-01-07 21:55:51,178 INFO L226 Difference]: Without dead ends: 35 [2019-01-07 21:55:51,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:55:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-07 21:55:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-07 21:55:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 21:55:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-07 21:55:51,182 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-07 21:55:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-07 21:55:51,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-07 21:55:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-07 21:55:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-07 21:55:51,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:51,184 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-07 21:55:51,184 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:51,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-07 21:55:51,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:51,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:51,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:51,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:51,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-07 21:55:51,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:51,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:51,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:51,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:51,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:51,531 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-01-07 21:55:51,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:51,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:51,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:51,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:51,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-07 21:55:51,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-07 21:55:51,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:51,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-07 21:55:51,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:51,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 21:55:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 21:55:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:55:51,931 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-07 21:55:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:52,036 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-07 21:55:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-07 21:55:52,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-07 21:55:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:52,038 INFO L225 Difference]: With dead ends: 55 [2019-01-07 21:55:52,038 INFO L226 Difference]: Without dead ends: 37 [2019-01-07 21:55:52,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:55:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-07 21:55:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-07 21:55:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:55:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-07 21:55:52,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-07 21:55:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:52,044 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-07 21:55:52,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 21:55:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-07 21:55:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-07 21:55:52,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:52,045 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-07 21:55:52,045 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-07 21:55:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:52,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:52,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:52,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-07 21:55:53,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:53,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:53,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:53,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:53,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:53,334 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-01-07 21:55:53,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:53,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:53,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-07 21:55:53,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-07 21:55:54,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:54,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-07 21:55:54,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:54,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-07 21:55:54,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-07 21:55:54,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-07 21:55:54,095 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-07 21:55:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:54,159 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-07 21:55:54,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 21:55:54,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-07 21:55:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:54,160 INFO L225 Difference]: With dead ends: 58 [2019-01-07 21:55:54,160 INFO L226 Difference]: Without dead ends: 39 [2019-01-07 21:55:54,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-07 21:55:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-07 21:55:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-07 21:55:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-07 21:55:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-07 21:55:54,166 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-07 21:55:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:54,166 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-07 21:55:54,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-07 21:55:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-07 21:55:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-07 21:55:54,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:54,167 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-07 21:55:54,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-07 21:55:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:54,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:54,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-07 21:55:54,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:54,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:54,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:54,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:54,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:54,356 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-01-07 21:55:54,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:54,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:54,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-07 21:55:54,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:54,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-07 21:55:54,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-07 21:55:55,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:55,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-07 21:55:55,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:55,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 21:55:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 21:55:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:55:55,251 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-07 21:55:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:55,329 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-07 21:55:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 21:55:55,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-07 21:55:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:55,330 INFO L225 Difference]: With dead ends: 61 [2019-01-07 21:55:55,331 INFO L226 Difference]: Without dead ends: 41 [2019-01-07 21:55:55,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:55:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-07 21:55:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-07 21:55:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:55:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-07 21:55:55,336 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-07 21:55:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:55,337 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-07 21:55:55,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-07 21:55:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-07 21:55:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-07 21:55:55,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:55,338 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-07 21:55:55,338 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-07 21:55:55,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:55,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:55,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:55,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-07 21:55:56,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:56,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:56,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:56,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:56,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:56,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 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-01-07 21:55:56,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:56,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:56,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:56,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:56,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-07 21:55:56,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-07 21:55:56,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-07 21:55:56,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:56,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-07 21:55:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-07 21:55:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-07 21:55:56,875 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-07 21:55:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:57,055 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-07 21:55:57,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-07 21:55:57,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-07 21:55:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:57,055 INFO L225 Difference]: With dead ends: 64 [2019-01-07 21:55:57,056 INFO L226 Difference]: Without dead ends: 43 [2019-01-07 21:55:57,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-07 21:55:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-07 21:55:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-07 21:55:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-07 21:55:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-07 21:55:57,066 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-07 21:55:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:57,066 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-07 21:55:57,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-07 21:55:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-07 21:55:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-07 21:55:57,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:57,067 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-07 21:55:57,067 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-07 21:55:57,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:57,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:57,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-07 21:55:57,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:57,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:57,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:57,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:57,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:57,347 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-01-07 21:55:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:57,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:57,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-07 21:55:57,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-07 21:55:58,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:58,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-07 21:55:58,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:58,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-07 21:55:58,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-07 21:55:58,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 21:55:58,153 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-07 21:55:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:58,233 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-07 21:55:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-07 21:55:58,234 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-07 21:55:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:58,234 INFO L225 Difference]: With dead ends: 67 [2019-01-07 21:55:58,235 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 21:55:58,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 21:55:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 21:55:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-07 21:55:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-07 21:55:58,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-07 21:55:58,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-07 21:55:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:58,241 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-07 21:55:58,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-07 21:55:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-07 21:55:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-07 21:55:58,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:58,243 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-07 21:55:58,243 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-07 21:55:58,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:58,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:58,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-07 21:55:58,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:58,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:58,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:58,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:58,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:58,679 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-01-07 21:55:58,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:58,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:58,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-07 21:55:58,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:58,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-07 21:55:58,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-07 21:55:59,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:59,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-07 21:55:59,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:59,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-07 21:55:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-07 21:55:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:55:59,297 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-07 21:55:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:59,370 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-07 21:55:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-07 21:55:59,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-07 21:55:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:59,372 INFO L225 Difference]: With dead ends: 70 [2019-01-07 21:55:59,372 INFO L226 Difference]: Without dead ends: 47 [2019-01-07 21:55:59,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:55:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-07 21:55:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-07 21:55:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 21:55:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-07 21:55:59,377 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-07 21:55:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:59,378 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-07 21:55:59,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-07 21:55:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-07 21:55:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-07 21:55:59,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:59,379 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-07 21:55:59,379 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-07 21:55:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:59,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:59,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-07 21:55:59,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:59,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:59,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:59,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:59,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:59,711 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-01-07 21:55:59,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:59,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:59,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:59,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:59,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-07 21:55:59,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:00,368 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-07 21:56:00,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:00,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-07 21:56:00,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:00,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-07 21:56:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-07 21:56:00,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 21:56:00,388 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-07 21:56:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:00,472 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-07 21:56:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-07 21:56:00,475 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-07 21:56:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:00,476 INFO L225 Difference]: With dead ends: 73 [2019-01-07 21:56:00,476 INFO L226 Difference]: Without dead ends: 49 [2019-01-07 21:56:00,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 21:56:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-07 21:56:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-07 21:56:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-07 21:56:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-07 21:56:00,481 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-07 21:56:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:00,481 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-07 21:56:00,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-07 21:56:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-07 21:56:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-07 21:56:00,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:00,482 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-07 21:56:00,483 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-07 21:56:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:00,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:00,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-07 21:56:01,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:01,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:01,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:01,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:01,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:01,580 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-01-07 21:56:01,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:01,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:01,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-07 21:56:01,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-07 21:56:02,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:02,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-07 21:56:02,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:02,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-07 21:56:02,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-07 21:56:02,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-07 21:56:02,233 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-07 21:56:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:02,369 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-07 21:56:02,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-07 21:56:02,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-07 21:56:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:02,373 INFO L225 Difference]: With dead ends: 76 [2019-01-07 21:56:02,373 INFO L226 Difference]: Without dead ends: 51 [2019-01-07 21:56:02,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-07 21:56:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-07 21:56:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-07 21:56:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-07 21:56:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-07 21:56:02,378 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-07 21:56:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:02,378 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-07 21:56:02,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-07 21:56:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-07 21:56:02,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-07 21:56:02,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:02,379 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-07 21:56:02,380 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-07 21:56:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:02,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:02,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:02,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-07 21:56:02,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:02,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:02,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:02,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:02,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:02,711 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-01-07 21:56:02,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:02,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:02,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-07 21:56:02,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:02,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-07 21:56:02,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-07 21:56:03,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:03,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-07 21:56:03,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:03,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 21:56:03,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 21:56:03,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:56:03,499 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-07 21:56:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:03,585 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-07 21:56:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 21:56:03,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-07 21:56:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:03,586 INFO L225 Difference]: With dead ends: 79 [2019-01-07 21:56:03,586 INFO L226 Difference]: Without dead ends: 53 [2019-01-07 21:56:03,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:56:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-07 21:56:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-07 21:56:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-07 21:56:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-07 21:56:03,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-07 21:56:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:03,592 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-07 21:56:03,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 21:56:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-07 21:56:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-07 21:56:03,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:03,592 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-07 21:56:03,593 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-07 21:56:03,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:03,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:03,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:03,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-07 21:56:04,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:04,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:04,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:04,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:04,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:04,384 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-01-07 21:56:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:04,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:04,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:04,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:04,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-07 21:56:04,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-07 21:56:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:05,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-07 21:56:05,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:05,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-07 21:56:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-07 21:56:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-07 21:56:05,718 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-07 21:56:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:05,829 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-07 21:56:05,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 21:56:05,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-07 21:56:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:05,830 INFO L225 Difference]: With dead ends: 82 [2019-01-07 21:56:05,830 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:56:05,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-07 21:56:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:56:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-07 21:56:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-07 21:56:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-07 21:56:05,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-07 21:56:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:05,836 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-07 21:56:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-07 21:56:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-07 21:56:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-07 21:56:05,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:05,837 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-07 21:56:05,837 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-07 21:56:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:05,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:05,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-07 21:56:06,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:06,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:06,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:06,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:06,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:06,625 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-01-07 21:56:06,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:06,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:06,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-07 21:56:06,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-07 21:56:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:07,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-07 21:56:07,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:07,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-07 21:56:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-07 21:56:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 21:56:07,532 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-07 21:56:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:07,655 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-07 21:56:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-07 21:56:07,656 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-07 21:56:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:07,656 INFO L225 Difference]: With dead ends: 85 [2019-01-07 21:56:07,657 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 21:56:07,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 21:56:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 21:56:07,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-07 21:56:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-07 21:56:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-07 21:56:07,662 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-07 21:56:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:07,663 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-07 21:56:07,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-07 21:56:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-07 21:56:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-07 21:56:07,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:07,664 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-07 21:56:07,664 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-07 21:56:07,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:07,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:07,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:07,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-07 21:56:08,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:08,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:08,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:08,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:08,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:08,236 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-01-07 21:56:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:08,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:08,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-07 21:56:08,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:08,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-07 21:56:08,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-07 21:56:09,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:09,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-07 21:56:09,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:09,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-07 21:56:09,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-07 21:56:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 21:56:09,181 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-07 21:56:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:09,277 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-07 21:56:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-07 21:56:09,278 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-07 21:56:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:09,279 INFO L225 Difference]: With dead ends: 88 [2019-01-07 21:56:09,279 INFO L226 Difference]: Without dead ends: 59 [2019-01-07 21:56:09,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 21:56:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-07 21:56:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-07 21:56:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 21:56:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-07 21:56:09,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-07 21:56:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:09,284 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-07 21:56:09,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-07 21:56:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-07 21:56:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-07 21:56:09,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:09,284 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-07 21:56:09,285 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:09,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-07 21:56:09,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:09,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:09,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:09,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-07 21:56:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:09,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:09,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:09,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:09,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:09,828 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-01-07 21:56:09,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:09,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:09,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:09,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:09,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-07 21:56:09,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-07 21:56:11,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-07 21:56:11,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:11,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-07 21:56:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-07 21:56:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 21:56:11,010 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-07 21:56:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:11,144 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-07 21:56:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-07 21:56:11,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-07 21:56:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:11,146 INFO L225 Difference]: With dead ends: 91 [2019-01-07 21:56:11,146 INFO L226 Difference]: Without dead ends: 61 [2019-01-07 21:56:11,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 21:56:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-07 21:56:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-07 21:56:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-07 21:56:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-07 21:56:11,151 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-07 21:56:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:11,152 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-07 21:56:11,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-07 21:56:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-07 21:56:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-07 21:56:11,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:11,153 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-07 21:56:11,153 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-07 21:56:11,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:11,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:11,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-07 21:56:12,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:12,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:12,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:12,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:12,090 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-01-07 21:56:12,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:12,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:12,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-07 21:56:12,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-07 21:56:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-07 21:56:13,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:13,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-07 21:56:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-07 21:56:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-07 21:56:13,370 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-07 21:56:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:13,492 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-07 21:56:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 21:56:13,493 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-07 21:56:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:13,493 INFO L225 Difference]: With dead ends: 94 [2019-01-07 21:56:13,494 INFO L226 Difference]: Without dead ends: 63 [2019-01-07 21:56:13,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-07 21:56:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-07 21:56:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-07 21:56:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-07 21:56:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-07 21:56:13,498 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-07 21:56:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:13,498 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-07 21:56:13,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-07 21:56:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-07 21:56:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-07 21:56:13,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:13,499 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-07 21:56:13,499 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-07 21:56:13,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:13,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:13,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:13,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:13,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-07 21:56:13,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:13,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:13,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:13,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:13,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:13,945 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-01-07 21:56:13,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:13,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:14,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-07 21:56:14,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:14,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-07 21:56:14,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-07 21:56:15,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:15,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-07 21:56:15,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 21:56:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 21:56:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:56:15,244 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-07 21:56:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:15,374 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-07 21:56:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 21:56:15,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-07 21:56:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:15,376 INFO L225 Difference]: With dead ends: 97 [2019-01-07 21:56:15,376 INFO L226 Difference]: Without dead ends: 65 [2019-01-07 21:56:15,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:56:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-07 21:56:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-07 21:56:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-07 21:56:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-07 21:56:15,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-07 21:56:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:15,380 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-07 21:56:15,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 21:56:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-07 21:56:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-07 21:56:15,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:15,381 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-07 21:56:15,381 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:15,381 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-07 21:56:15,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:15,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:15,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-07 21:56:16,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:16,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:16,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:16,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:16,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:16,431 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-01-07 21:56:16,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:16,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:16,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:16,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:16,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-07 21:56:16,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-07 21:56:17,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:17,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-07 21:56:17,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:17,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-07 21:56:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-07 21:56:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-07 21:56:17,952 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-07 21:56:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:18,187 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-07 21:56:18,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-07 21:56:18,188 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-07 21:56:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:18,189 INFO L225 Difference]: With dead ends: 100 [2019-01-07 21:56:18,189 INFO L226 Difference]: Without dead ends: 67 [2019-01-07 21:56:18,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-07 21:56:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-07 21:56:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-07 21:56:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-07 21:56:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-07 21:56:18,193 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-07 21:56:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:18,193 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-07 21:56:18,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-07 21:56:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-07 21:56:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-07 21:56:18,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:18,194 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-07 21:56:18,195 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:18,195 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-07 21:56:18,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:18,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:18,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-07 21:56:18,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:18,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:18,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:18,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:18,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:18,990 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-01-07 21:56:18,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:18,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:19,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-07 21:56:19,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-07 21:56:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-07 21:56:20,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:20,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-07 21:56:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-07 21:56:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 21:56:20,192 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-07 21:56:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:20,332 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-07 21:56:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-07 21:56:20,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-07 21:56:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:20,333 INFO L225 Difference]: With dead ends: 103 [2019-01-07 21:56:20,333 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 21:56:20,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 21:56:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 21:56:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-07 21:56:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-07 21:56:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-07 21:56:20,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-07 21:56:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:20,337 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-07 21:56:20,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-07 21:56:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-07 21:56:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-07 21:56:20,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:20,338 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-07 21:56:20,338 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-07 21:56:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:20,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:20,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-07 21:56:20,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:20,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:20,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:20,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:20,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:20,880 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-01-07 21:56:20,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:20,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:21,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-07 21:56:21,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:21,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-07 21:56:21,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-07 21:56:22,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:22,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-07 21:56:22,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:22,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-07 21:56:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-07 21:56:22,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 21:56:22,636 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-07 21:56:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:22,794 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-07 21:56:22,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 21:56:22,794 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-07 21:56:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:22,795 INFO L225 Difference]: With dead ends: 106 [2019-01-07 21:56:22,795 INFO L226 Difference]: Without dead ends: 71 [2019-01-07 21:56:22,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 21:56:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-07 21:56:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-07 21:56:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:56:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-07 21:56:22,800 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-07 21:56:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:22,800 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-07 21:56:22,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-07 21:56:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-07 21:56:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-07 21:56:22,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:22,801 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-07 21:56:22,801 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-07 21:56:22,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:22,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:22,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-07 21:56:23,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:23,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:23,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:23,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:23,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:23,459 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-01-07 21:56:23,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:23,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:23,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:23,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:23,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-07 21:56:23,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-07 21:56:25,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:25,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-07 21:56:25,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:25,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-07 21:56:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-07 21:56:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:56:25,089 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-07 21:56:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:25,258 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-07 21:56:25,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-07 21:56:25,259 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-07 21:56:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:25,260 INFO L225 Difference]: With dead ends: 109 [2019-01-07 21:56:25,260 INFO L226 Difference]: Without dead ends: 73 [2019-01-07 21:56:25,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:56:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-07 21:56:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-07 21:56:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-07 21:56:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-07 21:56:25,264 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-07 21:56:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:25,264 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-07 21:56:25,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-07 21:56:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-07 21:56:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-07 21:56:25,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:25,265 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-07 21:56:25,265 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:25,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-07 21:56:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:25,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:25,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-07 21:56:25,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:25,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:25,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:25,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:25,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:25,881 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-01-07 21:56:25,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:25,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:25,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-07 21:56:25,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-07 21:56:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:27,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-07 21:56:27,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:27,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-07 21:56:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-07 21:56:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-07 21:56:27,622 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-07 21:56:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:27,808 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-07 21:56:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 21:56:27,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-07 21:56:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:27,810 INFO L225 Difference]: With dead ends: 112 [2019-01-07 21:56:27,810 INFO L226 Difference]: Without dead ends: 75 [2019-01-07 21:56:27,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-07 21:56:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-07 21:56:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-07 21:56:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-07 21:56:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-07 21:56:27,814 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-07 21:56:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:27,815 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-07 21:56:27,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-07 21:56:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-07 21:56:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-07 21:56:27,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:27,815 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-07 21:56:27,816 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:27,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:27,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-07 21:56:27,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:27,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:27,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:27,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-07 21:56:28,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:28,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:28,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:28,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:28,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:28,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 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-01-07 21:56:28,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:28,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:28,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-07 21:56:28,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:28,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-07 21:56:28,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-07 21:56:30,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:30,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-07 21:56:30,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:30,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 21:56:30,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 21:56:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:56:30,320 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-07 21:56:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:30,453 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-07 21:56:30,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-07 21:56:30,453 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-07 21:56:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:30,454 INFO L225 Difference]: With dead ends: 115 [2019-01-07 21:56:30,454 INFO L226 Difference]: Without dead ends: 77 [2019-01-07 21:56:30,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:56:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-07 21:56:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-07 21:56:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:56:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-07 21:56:30,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-07 21:56:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:30,459 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-07 21:56:30,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 21:56:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-07 21:56:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-07 21:56:30,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:30,459 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-07 21:56:30,460 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-07 21:56:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:30,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:30,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-07 21:56:31,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:31,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:31,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:31,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:31,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:31,170 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-01-07 21:56:31,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:31,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:31,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:31,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:31,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-07 21:56:31,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-07 21:56:32,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:32,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-07 21:56:32,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:32,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-07 21:56:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-07 21:56:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-07 21:56:32,997 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-07 21:56:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:33,141 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-07 21:56:33,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 21:56:33,142 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-07 21:56:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:33,143 INFO L225 Difference]: With dead ends: 118 [2019-01-07 21:56:33,143 INFO L226 Difference]: Without dead ends: 79 [2019-01-07 21:56:33,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-07 21:56:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-07 21:56:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-07 21:56:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-07 21:56:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-07 21:56:33,147 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-07 21:56:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:33,147 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-07 21:56:33,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-07 21:56:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-07 21:56:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-07 21:56:33,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:33,148 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-07 21:56:33,148 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-07 21:56:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:33,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:33,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:33,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-07 21:56:33,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:33,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:33,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:33,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:33,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:33,823 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-01-07 21:56:33,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:33,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:33,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-07 21:56:33,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-07 21:56:35,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:35,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-07 21:56:35,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:35,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-07 21:56:35,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-07 21:56:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 21:56:35,524 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-07 21:56:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:35,675 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-07 21:56:35,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-07 21:56:35,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-07 21:56:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:35,677 INFO L225 Difference]: With dead ends: 121 [2019-01-07 21:56:35,677 INFO L226 Difference]: Without dead ends: 81 [2019-01-07 21:56:35,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 21:56:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-07 21:56:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-07 21:56:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-07 21:56:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-07 21:56:35,679 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-07 21:56:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:35,680 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-07 21:56:35,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-07 21:56:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-07 21:56:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-07 21:56:35,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:35,680 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-07 21:56:35,680 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-07 21:56:35,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:35,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:35,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-07 21:56:36,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:36,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:36,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:36,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:36,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:36,697 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-01-07 21:56:36,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:36,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:37,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-07 21:56:37,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:37,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-07 21:56:37,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-07 21:56:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:39,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-07 21:56:39,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:39,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-07 21:56:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-07 21:56:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:56:39,353 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-07 21:56:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:39,506 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-07 21:56:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-07 21:56:39,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-07 21:56:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:39,507 INFO L225 Difference]: With dead ends: 124 [2019-01-07 21:56:39,507 INFO L226 Difference]: Without dead ends: 83 [2019-01-07 21:56:39,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:56:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-07 21:56:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-07 21:56:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-07 21:56:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-07 21:56:39,511 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-07 21:56:39,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:39,511 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-07 21:56:39,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-07 21:56:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-07 21:56:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-07 21:56:39,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:39,512 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-07 21:56:39,512 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-07 21:56:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:39,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:39,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-07 21:56:40,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:40,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:40,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:40,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:40,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:40,372 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-01-07 21:56:40,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:40,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:40,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:40,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:40,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-07 21:56:40,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-07 21:56:42,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:42,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-07 21:56:42,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:42,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-07 21:56:42,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-07 21:56:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-07 21:56:42,214 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-07 21:56:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:42,506 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-07 21:56:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-07 21:56:42,506 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-07 21:56:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:42,507 INFO L225 Difference]: With dead ends: 127 [2019-01-07 21:56:42,507 INFO L226 Difference]: Without dead ends: 85 [2019-01-07 21:56:42,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-07 21:56:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-07 21:56:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-07 21:56:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-07 21:56:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-07 21:56:42,511 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-07 21:56:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:42,511 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-07 21:56:42,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-07 21:56:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-07 21:56:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-07 21:56:42,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:42,511 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-07 21:56:42,512 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-07 21:56:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:42,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:42,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-07 21:56:43,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:43,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:43,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:43,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:43,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:43,930 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-01-07 21:56:43,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:43,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:44,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-07 21:56:44,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-07 21:56:46,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:46,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-07 21:56:46,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:46,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-07 21:56:46,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-07 21:56:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-07 21:56:46,035 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-07 21:56:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:46,197 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-07 21:56:46,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-07 21:56:46,197 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-07 21:56:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:46,198 INFO L225 Difference]: With dead ends: 130 [2019-01-07 21:56:46,198 INFO L226 Difference]: Without dead ends: 87 [2019-01-07 21:56:46,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-07 21:56:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-07 21:56:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-07 21:56:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-07 21:56:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-07 21:56:46,202 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-07 21:56:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:46,202 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-07 21:56:46,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-07 21:56:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-07 21:56:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-07 21:56:46,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:46,203 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-07 21:56:46,203 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:46,204 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-07 21:56:46,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:46,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:46,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:46,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-07 21:56:47,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:47,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:47,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:47,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:47,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:47,125 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-01-07 21:56:47,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:47,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:47,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-07 21:56:47,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:47,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-07 21:56:47,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-07 21:56:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-07 21:56:49,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:49,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 21:56:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 21:56:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:56:49,610 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-07 21:56:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:49,835 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-07 21:56:49,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 21:56:49,835 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-07 21:56:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:49,836 INFO L225 Difference]: With dead ends: 133 [2019-01-07 21:56:49,836 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 21:56:49,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:56:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 21:56:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-07 21:56:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-07 21:56:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-07 21:56:49,840 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-07 21:56:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:49,841 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-07 21:56:49,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 21:56:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-07 21:56:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-07 21:56:49,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:49,841 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-07 21:56:49,842 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-07 21:56:49,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:49,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:49,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-07 21:56:51,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:51,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:51,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:51,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:51,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:51,675 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-01-07 21:56:51,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:51,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:51,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:51,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:51,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-07 21:56:51,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-07 21:56:54,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:54,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-07 21:56:54,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:54,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-07 21:56:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-07 21:56:54,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-07 21:56:54,323 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-07 21:56:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:54,497 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-07 21:56:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-07 21:56:54,497 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-07 21:56:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:54,498 INFO L225 Difference]: With dead ends: 136 [2019-01-07 21:56:54,498 INFO L226 Difference]: Without dead ends: 91 [2019-01-07 21:56:54,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-07 21:56:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-07 21:56:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-07 21:56:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 21:56:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-07 21:56:54,501 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-07 21:56:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:54,502 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-07 21:56:54,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-07 21:56:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-07 21:56:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-07 21:56:54,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:54,503 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-07 21:56:54,503 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-07 21:56:54,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:54,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:54,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:54,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-07 21:56:57,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:57,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:57,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:57,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:57,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:57,513 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-01-07 21:56:57,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:57,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:57,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-07 21:56:57,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-07 21:56:59,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:59,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-07 21:56:59,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:59,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-07 21:56:59,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-07 21:56:59,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-07 21:56:59,886 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-07 21:57:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:00,173 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-07 21:57:00,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-07 21:57:00,173 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-07 21:57:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:00,174 INFO L225 Difference]: With dead ends: 139 [2019-01-07 21:57:00,174 INFO L226 Difference]: Without dead ends: 93 [2019-01-07 21:57:00,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-07 21:57:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-07 21:57:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-07 21:57:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-07 21:57:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-07 21:57:00,177 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-07 21:57:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:00,177 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-07 21:57:00,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-07 21:57:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-07 21:57:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-07 21:57:00,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:00,178 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-07 21:57:00,178 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:00,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-07 21:57:00,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:00,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:00,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-07 21:57:01,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:01,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:01,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:01,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:01,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:01,036 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-01-07 21:57:01,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:01,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:01,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-07 21:57:01,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:01,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-07 21:57:01,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-07 21:57:03,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:03,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-07 21:57:03,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:03,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-07 21:57:03,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-07 21:57:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:57:03,933 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-07 21:57:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:04,943 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-07 21:57:04,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-07 21:57:04,944 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-07 21:57:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:04,944 INFO L225 Difference]: With dead ends: 142 [2019-01-07 21:57:04,944 INFO L226 Difference]: Without dead ends: 95 [2019-01-07 21:57:04,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:57:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-07 21:57:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-07 21:57:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-07 21:57:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-07 21:57:04,948 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-07 21:57:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:04,948 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-07 21:57:04,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-07 21:57:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-07 21:57:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-07 21:57:04,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:04,949 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-07 21:57:04,949 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-07 21:57:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:04,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:04,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-07 21:57:06,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:06,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:06,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:06,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:06,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:06,524 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-01-07 21:57:06,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:06,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:06,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:06,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:06,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-07 21:57:06,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-07 21:57:10,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:10,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-07 21:57:10,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:10,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-07 21:57:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-07 21:57:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:57:10,256 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-07 21:57:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:10,484 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-07 21:57:10,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-07 21:57:10,486 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-07 21:57:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:10,487 INFO L225 Difference]: With dead ends: 145 [2019-01-07 21:57:10,487 INFO L226 Difference]: Without dead ends: 97 [2019-01-07 21:57:10,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:57:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-07 21:57:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-07 21:57:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-07 21:57:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-07 21:57:10,491 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-07 21:57:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:10,491 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-07 21:57:10,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-07 21:57:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-07 21:57:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-07 21:57:10,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:10,492 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-07 21:57:10,492 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-07 21:57:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:10,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:10,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:10,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-07 21:57:11,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:11,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:11,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:11,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:11,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:11,619 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-01-07 21:57:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:11,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:11,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-07 21:57:11,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-07 21:57:14,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:14,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-07 21:57:14,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:14,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-07 21:57:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-07 21:57:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-07 21:57:14,660 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-07 21:57:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:14,837 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-07 21:57:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-07 21:57:14,838 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-07 21:57:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:14,839 INFO L225 Difference]: With dead ends: 148 [2019-01-07 21:57:14,839 INFO L226 Difference]: Without dead ends: 99 [2019-01-07 21:57:14,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-07 21:57:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-07 21:57:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-07 21:57:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-07 21:57:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-07 21:57:14,843 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-07 21:57:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:14,843 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-07 21:57:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-07 21:57:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-07 21:57:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-07 21:57:14,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:14,843 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-07 21:57:14,844 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-07 21:57:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:14,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-07 21:57:16,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:16,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:16,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:16,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:16,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:16,032 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-01-07 21:57:16,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:16,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:16,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-07 21:57:16,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:16,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-07 21:57:16,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-07 21:57:19,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:19,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-07 21:57:19,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:19,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 21:57:19,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 21:57:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:57:19,490 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-07 21:57:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:19,685 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-07 21:57:19,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 21:57:19,686 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-07 21:57:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:19,686 INFO L225 Difference]: With dead ends: 151 [2019-01-07 21:57:19,686 INFO L226 Difference]: Without dead ends: 101 [2019-01-07 21:57:19,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:57:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-07 21:57:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-07 21:57:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-07 21:57:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-07 21:57:19,690 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-07 21:57:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:19,690 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-07 21:57:19,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 21:57:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-07 21:57:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-07 21:57:19,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:19,691 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-07 21:57:19,691 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-07 21:57:19,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:19,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:19,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-07 21:57:20,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:20,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:20,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:20,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:20,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:20,688 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-01-07 21:57:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:20,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:20,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:20,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:20,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-07 21:57:20,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-07 21:57:23,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:23,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-07 21:57:23,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:23,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-07 21:57:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-07 21:57:23,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-07 21:57:23,727 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-07 21:57:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:24,047 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-07 21:57:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-07 21:57:24,047 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-07 21:57:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:24,048 INFO L225 Difference]: With dead ends: 154 [2019-01-07 21:57:24,048 INFO L226 Difference]: Without dead ends: 103 [2019-01-07 21:57:24,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-07 21:57:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-07 21:57:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-07 21:57:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-07 21:57:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-07 21:57:24,052 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-07 21:57:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:24,052 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-07 21:57:24,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-07 21:57:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-07 21:57:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-07 21:57:24,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:24,053 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-07 21:57:24,053 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-07 21:57:24,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:24,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:24,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:24,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-07 21:57:25,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:25,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:25,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:25,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:25,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:25,138 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-01-07 21:57:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:25,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:25,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-07 21:57:25,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-07 21:57:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-07 21:57:28,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:28,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-07 21:57:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-07 21:57:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 21:57:28,214 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-07 21:57:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:28,507 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-07 21:57:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-07 21:57:28,507 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-07 21:57:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:28,508 INFO L225 Difference]: With dead ends: 157 [2019-01-07 21:57:28,508 INFO L226 Difference]: Without dead ends: 105 [2019-01-07 21:57:28,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 21:57:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-07 21:57:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-07 21:57:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-07 21:57:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-07 21:57:28,511 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-07 21:57:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:28,512 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-07 21:57:28,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-07 21:57:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-07 21:57:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-07 21:57:28,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:28,513 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-07 21:57:28,513 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-07 21:57:28,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:28,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:28,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:28,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:28,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-07 21:57:30,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:30,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:30,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:30,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:30,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:30,064 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-01-07 21:57:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:30,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:31,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-07 21:57:31,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:31,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-07 21:57:31,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-07 21:57:34,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:34,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-07 21:57:34,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:34,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-07 21:57:34,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-07 21:57:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:57:34,541 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-07 21:57:35,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:35,514 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-07 21:57:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-07 21:57:35,514 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-07 21:57:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:35,515 INFO L225 Difference]: With dead ends: 160 [2019-01-07 21:57:35,515 INFO L226 Difference]: Without dead ends: 107 [2019-01-07 21:57:35,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:57:35,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-07 21:57:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-07 21:57:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-07 21:57:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-07 21:57:35,520 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-07 21:57:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:35,520 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-07 21:57:35,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-07 21:57:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-07 21:57:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-07 21:57:35,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:35,521 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-07 21:57:35,521 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-07 21:57:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:35,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:35,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-07 21:57:36,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:36,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:36,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:36,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:36,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:36,688 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-01-07 21:57:36,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:36,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:36,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:36,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:36,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-07 21:57:36,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-07 21:57:39,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-07 21:57:39,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:39,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-07 21:57:39,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-07 21:57:39,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 21:57:39,915 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-07 21:57:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:40,170 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-07 21:57:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-07 21:57:40,170 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-07 21:57:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:40,171 INFO L225 Difference]: With dead ends: 163 [2019-01-07 21:57:40,171 INFO L226 Difference]: Without dead ends: 109 [2019-01-07 21:57:40,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 21:57:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-07 21:57:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-07 21:57:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-07 21:57:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-07 21:57:40,175 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-07 21:57:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:40,176 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-07 21:57:40,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-07 21:57:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-07 21:57:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-07 21:57:40,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:40,177 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-07 21:57:40,177 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-07 21:57:40,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:40,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:40,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:40,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-07 21:57:41,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:41,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:41,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:41,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:41,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:41,693 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-01-07 21:57:41,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:41,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:41,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-07 21:57:41,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-07 21:57:45,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:45,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-07 21:57:45,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-07 21:57:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-07 21:57:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-07 21:57:45,092 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-07 21:57:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:45,365 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-07 21:57:45,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-07 21:57:45,366 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-07 21:57:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:45,366 INFO L225 Difference]: With dead ends: 166 [2019-01-07 21:57:45,366 INFO L226 Difference]: Without dead ends: 111 [2019-01-07 21:57:45,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-07 21:57:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-07 21:57:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-07 21:57:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-07 21:57:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-07 21:57:45,371 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-07 21:57:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:45,372 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-07 21:57:45,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-07 21:57:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-07 21:57:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-07 21:57:45,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:45,372 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-07 21:57:45,372 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-07 21:57:45,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:45,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:45,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:45,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-07 21:57:46,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:46,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:46,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:46,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:46,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:46,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 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-01-07 21:57:46,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:46,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:47,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-07 21:57:47,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:47,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-07 21:57:47,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-07 21:57:51,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:51,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-07 21:57:51,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:51,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-07 21:57:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-07 21:57:51,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:57:51,362 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-07 21:57:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:51,627 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-07 21:57:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-07 21:57:51,627 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-07 21:57:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:51,628 INFO L225 Difference]: With dead ends: 169 [2019-01-07 21:57:51,628 INFO L226 Difference]: Without dead ends: 113 [2019-01-07 21:57:51,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:57:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-07 21:57:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-07 21:57:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-07 21:57:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-07 21:57:51,631 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-07 21:57:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:51,631 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-07 21:57:51,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-07 21:57:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-07 21:57:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-07 21:57:51,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:51,632 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-07 21:57:51,632 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:51,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-07 21:57:51,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:51,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:51,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-07 21:57:53,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:53,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:53,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:53,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:53,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:53,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 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-01-07 21:57:53,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:53,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:53,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:53,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:53,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-07 21:57:53,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-07 21:57:56,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:56,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-07 21:57:56,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:56,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-07 21:57:56,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-07 21:57:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-07 21:57:56,608 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-07 21:57:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:56,856 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-07 21:57:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-07 21:57:56,856 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-07 21:57:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:56,857 INFO L225 Difference]: With dead ends: 172 [2019-01-07 21:57:56,857 INFO L226 Difference]: Without dead ends: 115 [2019-01-07 21:57:56,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-07 21:57:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-07 21:57:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-07 21:57:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-07 21:57:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-07 21:57:56,862 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-07 21:57:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:56,862 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-07 21:57:56,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-07 21:57:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-07 21:57:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-07 21:57:56,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:56,863 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-07 21:57:56,863 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:56,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-07 21:57:56,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:56,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:56,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:56,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:56,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-07 21:57:58,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:58,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:58,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:58,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:58,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:58,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 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-01-07 21:57:58,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:58,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:58,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-07 21:57:58,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-07 21:58:02,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:02,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-07 21:58:02,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:02,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-07 21:58:02,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-07 21:58:02,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:58:02,305 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-07 21:58:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:02,760 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-07 21:58:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-07 21:58:02,761 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-07 21:58:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:02,761 INFO L225 Difference]: With dead ends: 175 [2019-01-07 21:58:02,761 INFO L226 Difference]: Without dead ends: 117 [2019-01-07 21:58:02,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:58:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-07 21:58:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-07 21:58:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-07 21:58:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-07 21:58:02,766 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-07 21:58:02,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:02,766 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-07 21:58:02,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-07 21:58:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-07 21:58:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-07 21:58:02,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:02,767 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-07 21:58:02,767 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-07 21:58:02,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:02,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:02,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:02,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:02,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-07 21:58:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:04,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:04,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:04,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:04,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:04,065 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-01-07 21:58:04,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:58:04,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:58:04,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-07 21:58:04,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:04,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-07 21:58:04,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-07 21:58:08,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:08,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-07 21:58:08,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:08,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-07 21:58:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-07 21:58:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 21:58:08,898 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-07 21:58:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:09,237 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-07 21:58:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-07 21:58:09,237 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-07 21:58:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:09,238 INFO L225 Difference]: With dead ends: 178 [2019-01-07 21:58:09,238 INFO L226 Difference]: Without dead ends: 119 [2019-01-07 21:58:09,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 21:58:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-07 21:58:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-07 21:58:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-07 21:58:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-07 21:58:09,242 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-07 21:58:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:09,242 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-07 21:58:09,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-07 21:58:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-07 21:58:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-07 21:58:09,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:09,243 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-07 21:58:09,243 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-07 21:58:09,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:09,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:09,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:09,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-07 21:58:10,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:10,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:10,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:10,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:10,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:10,707 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-01-07 21:58:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:58:10,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:58:10,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:58:10,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:10,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-07 21:58:10,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-07 21:58:14,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-07 21:58:14,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:14,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-07 21:58:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-07 21:58:14,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 21:58:14,442 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-07 21:58:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:14,824 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-07 21:58:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-07 21:58:14,824 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-07 21:58:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:14,825 INFO L225 Difference]: With dead ends: 181 [2019-01-07 21:58:14,825 INFO L226 Difference]: Without dead ends: 121 [2019-01-07 21:58:14,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 21:58:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-07 21:58:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-07 21:58:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-07 21:58:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-07 21:58:14,829 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-07 21:58:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:14,829 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-07 21:58:14,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-07 21:58:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-07 21:58:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-07 21:58:14,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:14,830 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-07 21:58:14,830 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:14,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:14,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-07 21:58:14,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:14,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:14,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:14,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-07 21:58:16,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:16,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:16,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:16,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:16,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:16,145 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-01-07 21:58:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:16,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:58:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:16,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-07 21:58:16,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-07 21:58:20,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:20,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-07 21:58:20,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:20,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-07 21:58:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-07 21:58:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-07 21:58:20,287 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-07 21:58:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:20,665 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-07 21:58:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-07 21:58:20,665 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-07 21:58:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:20,666 INFO L225 Difference]: With dead ends: 184 [2019-01-07 21:58:20,666 INFO L226 Difference]: Without dead ends: 123 [2019-01-07 21:58:20,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-07 21:58:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-07 21:58:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-07 21:58:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-07 21:58:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-07 21:58:20,670 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-07 21:58:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:20,671 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-07 21:58:20,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-07 21:58:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-07 21:58:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-07 21:58:20,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:20,672 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-07 21:58:20,672 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-07 21:58:20,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:20,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:20,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-07 21:58:22,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:22,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:22,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:22,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:22,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:22,085 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-01-07 21:58:22,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:58:22,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:58:23,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-07 21:58:23,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:23,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-07 21:58:23,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-07 21:58:27,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:27,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-07 21:58:27,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:27,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-07 21:58:27,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-07 21:58:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:58:27,412 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-07 21:58:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:27,777 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-07 21:58:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 21:58:27,777 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-07 21:58:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:27,778 INFO L225 Difference]: With dead ends: 187 [2019-01-07 21:58:27,778 INFO L226 Difference]: Without dead ends: 125 [2019-01-07 21:58:27,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:58:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-07 21:58:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-07 21:58:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-07 21:58:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-07 21:58:27,783 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-07 21:58:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:27,783 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-07 21:58:27,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-07 21:58:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-07 21:58:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-07 21:58:27,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:27,785 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-07 21:58:27,785 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-07 21:58:27,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:27,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:27,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:27,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:27,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-07 21:58:29,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:29,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:29,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:29,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:29,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:29,360 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-01-07 21:58:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:58:29,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:58:29,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:58:29,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:29,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-07 21:58:29,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-07 21:58:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:33,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-07 21:58:33,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:33,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-07 21:58:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-07 21:58:33,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-07 21:58:33,831 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-07 21:58:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:34,115 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-07 21:58:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-07 21:58:34,115 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-07 21:58:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:34,116 INFO L225 Difference]: With dead ends: 190 [2019-01-07 21:58:34,116 INFO L226 Difference]: Without dead ends: 127 [2019-01-07 21:58:34,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-07 21:58:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-07 21:58:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-07 21:58:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-07 21:58:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-07 21:58:34,120 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-07 21:58:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:34,120 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-07 21:58:34,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-07 21:58:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-07 21:58:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-07 21:58:34,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:34,121 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-07 21:58:34,121 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-07 21:58:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:34,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:34,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:34,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:34,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-07 21:58:35,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:35,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:35,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:35,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:35,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:35,748 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-01-07 21:58:35,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:35,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:58:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:35,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-07 21:58:35,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-07 21:58:40,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:40,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-07 21:58:40,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:40,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-07 21:58:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-07 21:58:40,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 21:58:40,312 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-07 21:58:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:40,739 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-07 21:58:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-07 21:58:40,739 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-07 21:58:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:40,740 INFO L225 Difference]: With dead ends: 193 [2019-01-07 21:58:40,740 INFO L226 Difference]: Without dead ends: 129 [2019-01-07 21:58:40,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 21:58:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-07 21:58:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-07 21:58:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-07 21:58:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-07 21:58:40,744 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-07 21:58:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:40,744 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-07 21:58:40,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-07 21:58:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-07 21:58:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-07 21:58:40,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:40,745 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-07 21:58:40,745 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-07 21:58:40,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:40,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:40,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-07 21:58:42,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:42,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:42,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:42,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:42,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:42,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-07 21:58:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:58:42,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:58:43,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-07 21:58:43,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:43,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-07 21:58:43,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-07 21:58:47,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:47,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-07 21:58:47,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:47,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-07 21:58:47,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-07 21:58:47,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 21:58:47,950 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-07 21:58:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:48,344 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-07 21:58:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-07 21:58:48,345 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-07 21:58:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:48,345 INFO L225 Difference]: With dead ends: 196 [2019-01-07 21:58:48,345 INFO L226 Difference]: Without dead ends: 131 [2019-01-07 21:58:48,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 21:58:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-07 21:58:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-07 21:58:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-07 21:58:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-07 21:58:48,350 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-07 21:58:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:48,350 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-07 21:58:48,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-07 21:58:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-07 21:58:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-07 21:58:48,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:48,351 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-07 21:58:48,352 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-07 21:58:48,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:48,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:48,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-07 21:58:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:49,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:49,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:49,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:49,924 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-01-07 21:58:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:58:49,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:58:50,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:58:50,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:50,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-07 21:58:50,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-07 21:58:54,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:54,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-07 21:58:54,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:54,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-07 21:58:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-07 21:58:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 21:58:54,767 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-07 21:58:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:55,184 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-07 21:58:55,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-07 21:58:55,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-07 21:58:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:55,185 INFO L225 Difference]: With dead ends: 199 [2019-01-07 21:58:55,185 INFO L226 Difference]: Without dead ends: 133 [2019-01-07 21:58:55,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 21:58:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-07 21:58:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-07 21:58:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-07 21:58:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-07 21:58:55,191 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-07 21:58:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:55,191 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-07 21:58:55,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-07 21:58:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-07 21:58:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-07 21:58:55,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:55,192 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-07 21:58:55,192 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-07 21:58:55,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:55,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:55,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:55,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:55,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-07 21:58:57,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:57,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:57,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:57,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:57,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:57,037 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-01-07 21:58:57,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:57,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:58:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:57,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-07 21:58:57,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-07 21:59:02,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-07 21:59:02,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:02,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-07 21:59:02,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-07 21:59:02,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-07 21:59:02,825 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-07 21:59:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:03,306 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-07 21:59:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-07 21:59:03,306 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-07 21:59:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:03,307 INFO L225 Difference]: With dead ends: 202 [2019-01-07 21:59:03,307 INFO L226 Difference]: Without dead ends: 135 [2019-01-07 21:59:03,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-07 21:59:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-07 21:59:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-07 21:59:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-07 21:59:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-07 21:59:03,311 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-07 21:59:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:03,312 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-07 21:59:03,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-07 21:59:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-07 21:59:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-07 21:59:03,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:03,312 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-07 21:59:03,313 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-07 21:59:03,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:03,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:03,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:03,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:03,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-07 21:59:04,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:04,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:04,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:04,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:04,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:04,933 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-01-07 21:59:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:59:04,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:59:08,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-07 21:59:08,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:08,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-07 21:59:08,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-07 21:59:13,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:13,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-07 21:59:13,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:13,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-07 21:59:13,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-07 21:59:13,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:59:13,748 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-07 21:59:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:14,136 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-07 21:59:14,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 21:59:14,136 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-07 21:59:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:14,137 INFO L225 Difference]: With dead ends: 205 [2019-01-07 21:59:14,137 INFO L226 Difference]: Without dead ends: 137 [2019-01-07 21:59:14,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:59:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-07 21:59:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-07 21:59:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-07 21:59:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-07 21:59:14,142 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-07 21:59:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:14,142 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-07 21:59:14,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-07 21:59:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-07 21:59:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-07 21:59:14,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:14,143 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-07 21:59:14,143 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-07 21:59:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:14,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:14,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-07 21:59:16,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:16,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:16,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:16,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:16,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:16,785 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-01-07 21:59:16,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:59:16,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:59:16,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:59:16,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:16,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-07 21:59:16,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-07 21:59:22,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:22,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-07 21:59:22,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:22,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-07 21:59:22,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-07 21:59:22,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-07 21:59:22,099 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-07 21:59:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:22,596 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-07 21:59:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-07 21:59:22,596 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-07 21:59:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:22,597 INFO L225 Difference]: With dead ends: 208 [2019-01-07 21:59:22,597 INFO L226 Difference]: Without dead ends: 139 [2019-01-07 21:59:22,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-07 21:59:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-07 21:59:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-07 21:59:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-07 21:59:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-07 21:59:22,601 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-07 21:59:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:22,601 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-07 21:59:22,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-07 21:59:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-07 21:59:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-07 21:59:22,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:22,602 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-07 21:59:22,602 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-07 21:59:22,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:22,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:22,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-07 21:59:24,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:24,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:24,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:24,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:24,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:24,329 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:24,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:24,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:59:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:24,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-07 21:59:24,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-07 21:59:29,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:29,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-07 21:59:29,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:29,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-07 21:59:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-07 21:59:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-07 21:59:29,670 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-07 21:59:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:30,165 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-07 21:59:30,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-07 21:59:30,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-07 21:59:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:30,166 INFO L225 Difference]: With dead ends: 211 [2019-01-07 21:59:30,166 INFO L226 Difference]: Without dead ends: 141 [2019-01-07 21:59:30,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-07 21:59:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-07 21:59:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-07 21:59:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-07 21:59:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-07 21:59:30,171 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-07 21:59:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:30,171 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-07 21:59:30,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-07 21:59:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-07 21:59:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-07 21:59:30,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:30,172 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-07 21:59:30,173 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-07 21:59:30,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:30,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:30,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:30,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-07 21:59:32,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:32,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:32,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:32,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:32,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:32,166 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:32,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:59:32,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:59:36,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-07 21:59:36,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:36,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-07 21:59:36,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-07 21:59:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-07 21:59:41,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:41,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-07 21:59:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-07 21:59:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:59:41,522 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-07 21:59:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:42,118 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-07 21:59:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-07 21:59:42,118 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-07 21:59:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:42,119 INFO L225 Difference]: With dead ends: 214 [2019-01-07 21:59:42,119 INFO L226 Difference]: Without dead ends: 143 [2019-01-07 21:59:42,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:59:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-07 21:59:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-07 21:59:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-07 21:59:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-07 21:59:42,123 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-07 21:59:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:42,123 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-07 21:59:42,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-07 21:59:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-07 21:59:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-07 21:59:42,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:42,124 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-07 21:59:42,124 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:42,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-07 21:59:42,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:42,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:42,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-07 21:59:43,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:43,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:43,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:43,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:43,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:43,960 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:59:43,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:59:44,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:59:44,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:44,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-07 21:59:44,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-07 21:59:49,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:49,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-07 21:59:49,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:49,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-07 21:59:49,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-07 21:59:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 21:59:49,636 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-07 21:59:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:50,163 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-07 21:59:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 21:59:50,164 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-07 21:59:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:50,165 INFO L225 Difference]: With dead ends: 217 [2019-01-07 21:59:50,165 INFO L226 Difference]: Without dead ends: 145 [2019-01-07 21:59:50,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 21:59:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-07 21:59:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-07 21:59:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-07 21:59:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-07 21:59:50,169 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-07 21:59:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:50,169 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-07 21:59:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-07 21:59:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-07 21:59:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-07 21:59:50,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:50,170 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-07 21:59:50,170 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-07 21:59:50,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:50,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:50,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:50,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-07 21:59:52,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:52,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:52,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:52,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:52,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:52,354 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:52,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:59:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-07 21:59:52,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-07 21:59:58,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:58,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-07 21:59:58,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:58,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-07 21:59:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-07 21:59:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-07 21:59:58,070 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-07 21:59:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:58,491 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-07 21:59:58,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-07 21:59:58,492 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-07 21:59:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:58,493 INFO L225 Difference]: With dead ends: 220 [2019-01-07 21:59:58,493 INFO L226 Difference]: Without dead ends: 147 [2019-01-07 21:59:58,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-07 21:59:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-07 21:59:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-07 21:59:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-07 21:59:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-07 21:59:58,497 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-07 21:59:58,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:58,497 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-07 21:59:58,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-07 21:59:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-07 21:59:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-07 21:59:58,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:58,498 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-07 21:59:58,498 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-07 21:59:58,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:58,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-07 22:00:00,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:00,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:00,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:00,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:00,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:00,520 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:00:00,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:00:03,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-07 22:00:03,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:03,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-07 22:00:03,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-07 22:00:09,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:09,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-07 22:00:09,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:09,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 22:00:09,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 22:00:09,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 22:00:09,540 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-07 22:00:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:10,129 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-07 22:00:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-07 22:00:10,130 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-07 22:00:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:10,130 INFO L225 Difference]: With dead ends: 223 [2019-01-07 22:00:10,130 INFO L226 Difference]: Without dead ends: 149 [2019-01-07 22:00:10,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 22:00:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-07 22:00:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-07 22:00:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-07 22:00:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-07 22:00:10,135 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-07 22:00:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:10,135 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-07 22:00:10,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 22:00:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-07 22:00:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-07 22:00:10,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:10,136 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-07 22:00:10,137 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-07 22:00:10,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:10,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:10,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-07 22:00:12,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:12,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:12,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:12,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:12,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:12,427 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:12,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:00:12,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:00:12,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:00:12,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:12,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-07 22:00:12,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-07 22:00:18,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:18,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-07 22:00:18,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:18,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-07 22:00:18,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-07 22:00:18,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-07 22:00:18,523 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-07 22:00:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:19,067 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-07 22:00:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-07 22:00:19,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-07 22:00:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:19,068 INFO L225 Difference]: With dead ends: 226 [2019-01-07 22:00:19,068 INFO L226 Difference]: Without dead ends: 151 [2019-01-07 22:00:19,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-07 22:00:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-07 22:00:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-07 22:00:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-07 22:00:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-07 22:00:19,073 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-07 22:00:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:19,073 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-07 22:00:19,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-07 22:00:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-07 22:00:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-07 22:00:19,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:19,074 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-07 22:00:19,075 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-07 22:00:19,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:19,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:19,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-07 22:00:21,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:21,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:21,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:21,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:21,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:21,133 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:21,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:21,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:00:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:21,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-07 22:00:21,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-07 22:00:27,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:27,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-07 22:00:27,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:27,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-07 22:00:27,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-07 22:00:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 22:00:27,390 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-07 22:00:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:27,998 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-07 22:00:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-07 22:00:27,998 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-07 22:00:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:27,999 INFO L225 Difference]: With dead ends: 229 [2019-01-07 22:00:27,999 INFO L226 Difference]: Without dead ends: 153 [2019-01-07 22:00:28,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 22:00:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-07 22:00:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-07 22:00:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-07 22:00:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-07 22:00:28,004 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-07 22:00:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:28,004 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-07 22:00:28,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-07 22:00:28,005 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-07 22:00:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-07 22:00:28,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:28,005 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-07 22:00:28,006 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-07 22:00:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:28,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:28,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-07 22:00:30,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:30,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:30,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:30,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:30,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:30,154 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:30,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:00:30,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:00:32,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-07 22:00:32,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:32,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-07 22:00:32,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-07 22:00:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:39,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-07 22:00:39,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:39,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-07 22:00:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-07 22:00:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 22:00:39,229 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-07 22:00:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:39,829 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-07 22:00:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-07 22:00:39,829 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-07 22:00:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:39,830 INFO L225 Difference]: With dead ends: 232 [2019-01-07 22:00:39,830 INFO L226 Difference]: Without dead ends: 155 [2019-01-07 22:00:39,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 22:00:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-07 22:00:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-07 22:00:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-07 22:00:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-07 22:00:39,833 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-07 22:00:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:39,834 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-07 22:00:39,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-07 22:00:39,834 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-07 22:00:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-07 22:00:39,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:39,834 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-07 22:00:39,834 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-07 22:00:39,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:39,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:39,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-07 22:00:42,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:42,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:42,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:42,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:42,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:42,016 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:42,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:00:42,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:00:42,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:00:42,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:42,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-07 22:00:42,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-07 22:00:48,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:48,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-07 22:00:48,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:48,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-07 22:00:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-07 22:00:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-07 22:00:48,850 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-07 22:00:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:49,576 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-07 22:00:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-07 22:00:49,577 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-07 22:00:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:49,577 INFO L225 Difference]: With dead ends: 235 [2019-01-07 22:00:49,577 INFO L226 Difference]: Without dead ends: 157 [2019-01-07 22:00:49,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-07 22:00:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-07 22:00:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-07 22:00:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-07 22:00:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-07 22:00:49,581 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-07 22:00:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:49,581 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-07 22:00:49,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-07 22:00:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-07 22:00:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-07 22:00:49,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:49,582 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-07 22:00:49,582 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-07 22:00:49,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:49,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:49,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:49,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:49,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-07 22:00:51,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:51,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:51,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:51,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:51,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:51,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:51,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:00:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:51,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-07 22:00:51,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-07 22:00:58,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-07 22:00:58,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:58,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-07 22:00:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-07 22:00:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 22:00:58,826 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-07 22:00:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:59,422 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-07 22:00:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-07 22:00:59,422 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-07 22:00:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:59,424 INFO L225 Difference]: With dead ends: 238 [2019-01-07 22:00:59,424 INFO L226 Difference]: Without dead ends: 159 [2019-01-07 22:00:59,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 22:00:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-07 22:00:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-07 22:00:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-07 22:00:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-07 22:00:59,428 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-07 22:00:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:59,428 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-07 22:00:59,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-07 22:00:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-07 22:00:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-07 22:00:59,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:59,429 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-07 22:00:59,429 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-07 22:00:59,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:59,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:59,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-07 22:01:01,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:01,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:01,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:01,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:01,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:01,661 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:01,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:01:01,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:01:06,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-07 22:01:06,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:06,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-07 22:01:06,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-07 22:01:13,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:13,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-07 22:01:13,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:13,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 22:01:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 22:01:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 22:01:13,391 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-07 22:01:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:14,099 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-07 22:01:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-07 22:01:14,100 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-07 22:01:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:14,101 INFO L225 Difference]: With dead ends: 241 [2019-01-07 22:01:14,101 INFO L226 Difference]: Without dead ends: 161 [2019-01-07 22:01:14,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 22:01:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-07 22:01:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-07 22:01:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-07 22:01:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-07 22:01:14,107 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-07 22:01:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:14,107 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-07 22:01:14,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 22:01:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-07 22:01:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-07 22:01:14,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:14,108 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-07 22:01:14,108 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:14,108 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-07 22:01:14,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:14,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:14,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:14,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:14,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-07 22:01:16,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:16,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:16,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:16,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:16,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:16,479 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:16,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:01:16,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:01:16,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:01:16,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:16,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-07 22:01:16,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-07 22:01:23,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:23,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-07 22:01:23,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:23,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-07 22:01:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-07 22:01:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 22:01:23,495 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-07 22:01:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:24,259 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-07 22:01:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-07 22:01:24,259 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-07 22:01:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:24,260 INFO L225 Difference]: With dead ends: 244 [2019-01-07 22:01:24,260 INFO L226 Difference]: Without dead ends: 163 [2019-01-07 22:01:24,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 22:01:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-07 22:01:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-07 22:01:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-07 22:01:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-07 22:01:24,265 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-07 22:01:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:24,266 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-07 22:01:24,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-07 22:01:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-07 22:01:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-07 22:01:24,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:24,267 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-07 22:01:24,267 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:24,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-07 22:01:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:24,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:24,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-07 22:01:26,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:26,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:26,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:26,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:26,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:26,628 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:01:26,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:01:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:26,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-07 22:01:26,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-07 22:01:34,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:34,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-07 22:01:34,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:34,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-07 22:01:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-07 22:01:34,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 22:01:34,108 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-07 22:01:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:34,955 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-07 22:01:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-07 22:01:34,956 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-07 22:01:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:34,957 INFO L225 Difference]: With dead ends: 247 [2019-01-07 22:01:34,957 INFO L226 Difference]: Without dead ends: 165 [2019-01-07 22:01:34,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 22:01:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-07 22:01:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-07 22:01:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-07 22:01:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-07 22:01:34,960 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-07 22:01:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:34,961 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-07 22:01:34,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-07 22:01:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-07 22:01:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-07 22:01:34,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:34,962 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-07 22:01:34,962 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-07 22:01:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:34,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:01:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:34,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-07 22:01:37,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:37,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:37,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:37,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:37,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:37,482 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:37,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:01:37,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:01:40,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-07 22:01:40,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:40,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-07 22:01:40,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-07 22:01:48,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:48,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-07 22:01:48,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:48,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-07 22:01:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-07 22:01:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 22:01:48,202 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-07 22:01:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:49,034 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-07 22:01:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-07 22:01:49,034 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-07 22:01:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:49,035 INFO L225 Difference]: With dead ends: 250 [2019-01-07 22:01:49,035 INFO L226 Difference]: Without dead ends: 167 [2019-01-07 22:01:49,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 22:01:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-07 22:01:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-07 22:01:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-07 22:01:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-07 22:01:49,039 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-07 22:01:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:49,040 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-07 22:01:49,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-07 22:01:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-07 22:01:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-07 22:01:49,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:49,041 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-07 22:01:49,041 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-07 22:01:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:49,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:49,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-07 22:01:51,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:51,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:51,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:51,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:51,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:51,845 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:51,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:01:51,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:01:51,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:01:51,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:51,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-07 22:01:52,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-07 22:01:59,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-07 22:01:59,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:59,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-07 22:01:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-07 22:01:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 22:01:59,462 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-07 22:02:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:00,179 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-07 22:02:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-07 22:02:00,179 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-07 22:02:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:00,180 INFO L225 Difference]: With dead ends: 253 [2019-01-07 22:02:00,180 INFO L226 Difference]: Without dead ends: 169 [2019-01-07 22:02:00,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 22:02:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-07 22:02:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-07 22:02:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-07 22:02:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-07 22:02:00,184 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-07 22:02:00,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:00,184 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-07 22:02:00,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-07 22:02:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-07 22:02:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-07 22:02:00,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:00,185 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-07 22:02:00,185 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:00,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-07 22:02:00,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:00,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:02:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:00,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-07 22:02:02,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:02,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:02,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:02,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:02,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:02,671 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:02,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:02:02,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:02:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:02,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-07 22:02:02,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-07 22:02:10,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:10,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-07 22:02:10,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:10,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-07 22:02:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-07 22:02:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 22:02:10,790 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-07 22:02:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:11,659 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-07 22:02:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-07 22:02:11,660 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-07 22:02:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:11,660 INFO L225 Difference]: With dead ends: 256 [2019-01-07 22:02:11,661 INFO L226 Difference]: Without dead ends: 171 [2019-01-07 22:02:11,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 22:02:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-07 22:02:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-07 22:02:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-07 22:02:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-07 22:02:11,664 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-07 22:02:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:11,665 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-07 22:02:11,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-07 22:02:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-07 22:02:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-07 22:02:11,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:11,665 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-07 22:02:11,666 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-07 22:02:11,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:11,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:02:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:11,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-07 22:02:14,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:14,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:14,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:14,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:14,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:14,232 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:02:14,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:02:24,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-07 22:02:24,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:02:24,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-07 22:02:24,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-07 22:02:32,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:32,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-07 22:02:32,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:32,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 22:02:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 22:02:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 22:02:32,186 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-07 22:02:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:33,162 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-07 22:02:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-07 22:02:33,162 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-07 22:02:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:33,163 INFO L225 Difference]: With dead ends: 259 [2019-01-07 22:02:33,163 INFO L226 Difference]: Without dead ends: 173 [2019-01-07 22:02:33,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 22:02:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-07 22:02:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-07 22:02:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-07 22:02:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-07 22:02:33,167 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-07 22:02:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:33,167 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-07 22:02:33,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 22:02:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-07 22:02:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-07 22:02:33,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:33,168 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-07 22:02:33,168 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-07 22:02:33,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:33,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:02:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:33,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-07 22:02:36,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:36,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:36,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:36,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:36,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:36,053 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:36,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:02:36,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:02:36,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:02:36,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:02:36,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-07 22:02:36,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-07 22:02:44,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:44,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-07 22:02:44,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:44,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-07 22:02:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-07 22:02:44,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-07 22:02:44,295 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-07 22:02:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:45,282 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-07 22:02:45,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-07 22:02:45,283 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-07 22:02:45,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:45,283 INFO L225 Difference]: With dead ends: 262 [2019-01-07 22:02:45,283 INFO L226 Difference]: Without dead ends: 175 [2019-01-07 22:02:45,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-07 22:02:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-07 22:02:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-07 22:02:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-07 22:02:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-07 22:02:45,288 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-07 22:02:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:45,289 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-07 22:02:45,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-07 22:02:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-07 22:02:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-07 22:02:45,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:45,290 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-07 22:02:45,290 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-07 22:02:45,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:45,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:02:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:45,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-07 22:02:48,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:48,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:48,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:48,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:48,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:48,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:48,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:02:48,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:02:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:48,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-07 22:02:48,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-07 22:02:56,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:56,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-07 22:02:56,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:56,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-07 22:02:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-07 22:02:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 22:02:56,951 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-07 22:02:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:57,966 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-07 22:02:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-07 22:02:57,966 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-07 22:02:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:57,967 INFO L225 Difference]: With dead ends: 265 [2019-01-07 22:02:57,967 INFO L226 Difference]: Without dead ends: 177 [2019-01-07 22:02:57,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 22:02:57,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-07 22:02:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-07 22:02:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-07 22:02:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-07 22:02:57,972 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-07 22:02:57,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:57,972 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-07 22:02:57,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-07 22:02:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-07 22:02:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-07 22:02:57,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:57,974 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-07 22:02:57,974 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-07 22:02:57,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:57,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:57,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:02:57,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:57,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-07 22:03:00,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:00,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:00,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:00,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:00,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:00,730 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:00,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:03:00,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:03:11,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-07 22:03:11,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:03:11,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-07 22:03:11,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-07 22:03:20,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:20,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-07 22:03:20,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:20,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-07 22:03:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-07 22:03:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 22:03:20,004 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-07 22:03:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:20,876 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-07 22:03:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-07 22:03:20,877 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-07 22:03:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:20,877 INFO L225 Difference]: With dead ends: 268 [2019-01-07 22:03:20,877 INFO L226 Difference]: Without dead ends: 179 [2019-01-07 22:03:20,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 22:03:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-07 22:03:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-07 22:03:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-07 22:03:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-07 22:03:20,881 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-07 22:03:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:20,881 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-07 22:03:20,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-07 22:03:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-07 22:03:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-07 22:03:20,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:20,882 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-07 22:03:20,883 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:20,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:20,883 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-07 22:03:20,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:20,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:20,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:03:20,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:20,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-07 22:03:24,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:24,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:24,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:24,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:24,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:24,072 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:24,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:03:24,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:03:24,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:03:24,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:03:24,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-07 22:03:24,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-07 22:03:32,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:32,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-07 22:03:32,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:32,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-07 22:03:32,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-07 22:03:32,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 22:03:32,863 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-07 22:03:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:33,952 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-07 22:03:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-07 22:03:33,952 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-07 22:03:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:33,953 INFO L225 Difference]: With dead ends: 271 [2019-01-07 22:03:33,953 INFO L226 Difference]: Without dead ends: 181 [2019-01-07 22:03:33,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 22:03:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-07 22:03:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-07 22:03:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-07 22:03:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-07 22:03:33,957 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-07 22:03:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:33,957 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-07 22:03:33,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-07 22:03:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-07 22:03:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-07 22:03:33,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:33,958 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-07 22:03:33,958 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:33,958 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-07 22:03:33,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:33,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:03:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:33,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-07 22:03:36,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:36,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:36,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:36,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:36,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:36,880 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:36,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:03:36,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:03:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:37,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-07 22:03:37,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-07 22:03:45,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:45,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-07 22:03:45,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:45,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-07 22:03:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-07 22:03:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 22:03:45,910 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-07 22:03:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:46,819 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-07 22:03:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-07 22:03:46,820 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-07 22:03:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:46,821 INFO L225 Difference]: With dead ends: 274 [2019-01-07 22:03:46,821 INFO L226 Difference]: Without dead ends: 183 [2019-01-07 22:03:46,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 22:03:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-07 22:03:46,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-07 22:03:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-07 22:03:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-07 22:03:46,826 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-07 22:03:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:46,826 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-07 22:03:46,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-07 22:03:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-07 22:03:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-07 22:03:46,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:46,827 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-07 22:03:46,827 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-07 22:03:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:03:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:46,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-07 22:03:50,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:50,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:50,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:50,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:50,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:50,053 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:50,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:03:50,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:03:55,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-07 22:03:55,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:03:55,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-07 22:03:55,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-07 22:04:04,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:04,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-07 22:04:04,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:04,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 22:04:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 22:04:04,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 22:04:04,602 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-07 22:04:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:05,471 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-07 22:04:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-07 22:04:05,472 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-07 22:04:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:05,473 INFO L225 Difference]: With dead ends: 277 [2019-01-07 22:04:05,473 INFO L226 Difference]: Without dead ends: 185 [2019-01-07 22:04:05,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 22:04:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-07 22:04:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-07 22:04:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-07 22:04:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-07 22:04:05,477 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-07 22:04:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:05,477 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-07 22:04:05,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 22:04:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-07 22:04:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-07 22:04:05,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:05,478 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-07 22:04:05,478 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-07 22:04:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:05,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:04:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:05,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-07 22:04:08,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:08,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:08,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:08,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:08,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:08,879 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:08,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:04:08,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:04:09,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:04:09,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:04:09,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-07 22:04:09,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-07 22:04:18,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:18,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-07 22:04:18,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:18,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-07 22:04:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-07 22:04:18,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 22:04:18,403 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-07 22:04:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:19,363 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-07 22:04:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-07 22:04:19,364 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-07 22:04:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:19,364 INFO L225 Difference]: With dead ends: 280 [2019-01-07 22:04:19,365 INFO L226 Difference]: Without dead ends: 187 [2019-01-07 22:04:19,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 22:04:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-07 22:04:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-07 22:04:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-07 22:04:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-07 22:04:19,370 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-07 22:04:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:19,370 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-07 22:04:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-07 22:04:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-07 22:04:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-07 22:04:19,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:19,372 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-07 22:04:19,372 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-07 22:04:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:19,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:04:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:19,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-07 22:04:22,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:22,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:22,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:22,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:22,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:22,512 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:22,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:04:22,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:04:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:22,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-07 22:04:22,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-07 22:04:32,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:32,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-07 22:04:32,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:32,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-07 22:04:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-07 22:04:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 22:04:32,365 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-07 22:04:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:33,653 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-07 22:04:33,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-07 22:04:33,653 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-07 22:04:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:33,654 INFO L225 Difference]: With dead ends: 283 [2019-01-07 22:04:33,654 INFO L226 Difference]: Without dead ends: 189 [2019-01-07 22:04:33,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 22:04:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-07 22:04:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-07 22:04:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-07 22:04:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-07 22:04:33,659 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-07 22:04:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:33,659 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-07 22:04:33,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-07 22:04:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-07 22:04:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-07 22:04:33,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:33,660 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-07 22:04:33,661 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-07 22:04:33,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:33,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:33,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:04:33,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:33,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-07 22:04:36,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:36,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:36,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:36,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:36,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:36,835 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:36,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:04:36,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:04:42,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-07 22:04:42,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:04:42,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-07 22:04:42,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-07 22:04:52,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:52,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-07 22:04:52,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:52,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-07 22:04:52,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-07 22:04:52,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 22:04:52,486 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-07 22:04:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:53,595 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-07 22:04:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-07 22:04:53,596 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-07 22:04:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:53,597 INFO L225 Difference]: With dead ends: 286 [2019-01-07 22:04:53,597 INFO L226 Difference]: Without dead ends: 191 [2019-01-07 22:04:53,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 22:04:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-07 22:04:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-07 22:04:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-07 22:04:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-07 22:04:53,601 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-07 22:04:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:53,602 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-07 22:04:53,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-07 22:04:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-07 22:04:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-07 22:04:53,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:53,603 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-07 22:04:53,603 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-07 22:04:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:53,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:04:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:53,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-07 22:04:57,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:57,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:57,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:57,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:57,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:57,066 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:04:57,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:04:57,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:04:57,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:04:57,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-07 22:04:57,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:05:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-07 22:05:07,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:05:07,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-07 22:05:07,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:05:07,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-07 22:05:07,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-07 22:05:07,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 22:05:07,186 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-07 22:05:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:05:08,570 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-07 22:05:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-07 22:05:08,571 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-07 22:05:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:05:08,572 INFO L225 Difference]: With dead ends: 289 [2019-01-07 22:05:08,572 INFO L226 Difference]: Without dead ends: 193 [2019-01-07 22:05:08,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 22:05:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-07 22:05:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-07 22:05:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-07 22:05:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-07 22:05:08,576 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-07 22:05:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:05:08,576 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-07 22:05:08,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-07 22:05:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-07 22:05:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-07 22:05:08,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:05:08,577 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-07 22:05:08,577 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:05:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:05:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-07 22:05:08,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:05:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:08,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:05:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:08,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:05:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-07 22:05:12,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:12,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:12,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:12,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:12,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:12,082 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:12,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:05:12,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:05:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:12,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-07 22:05:12,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:05:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-07 22:05:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:05:22,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-07 22:05:22,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:05:22,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-07 22:05:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-07 22:05:22,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-07 22:05:22,426 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-07 22:05:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:05:23,763 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-07 22:05:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-07 22:05:23,763 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-07 22:05:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:05:23,764 INFO L225 Difference]: With dead ends: 292 [2019-01-07 22:05:23,764 INFO L226 Difference]: Without dead ends: 195 [2019-01-07 22:05:23,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-07 22:05:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-07 22:05:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-07 22:05:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-07 22:05:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-07 22:05:23,769 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-07 22:05:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:05:23,769 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-07 22:05:23,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-07 22:05:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-07 22:05:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-07 22:05:23,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:05:23,770 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-07 22:05:23,771 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:05:23,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:05:23,771 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-07 22:05:23,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:05:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:05:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:23,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:05:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-07 22:05:27,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:27,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:27,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:27,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:27,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:27,489 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:27,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:05:27,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:05:34,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-07 22:05:34,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:05:34,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-07 22:05:34,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:05:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-07 22:05:44,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:05:44,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-07 22:05:44,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:05:44,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-07 22:05:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-07 22:05:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 22:05:44,778 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-07 22:05:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:05:46,224 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-07 22:05:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-07 22:05:46,224 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-07 22:05:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:05:46,225 INFO L225 Difference]: With dead ends: 295 [2019-01-07 22:05:46,225 INFO L226 Difference]: Without dead ends: 197 [2019-01-07 22:05:46,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 22:05:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-07 22:05:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-07 22:05:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-07 22:05:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-07 22:05:46,230 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-07 22:05:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:05:46,230 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-07 22:05:46,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-07 22:05:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-07 22:05:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-07 22:05:46,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:05:46,231 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-07 22:05:46,231 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:05:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:05:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-07 22:05:46,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:05:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:46,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:05:46,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:46,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:05:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-07 22:05:49,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:49,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:49,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:49,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:49,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:49,666 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:49,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:05:49,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:05:49,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:05:49,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:05:49,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-07 22:05:49,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-07 22:06:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:00,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-07 22:06:00,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:00,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-07 22:06:00,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-07 22:06:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-07 22:06:00,498 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-07 22:06:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:02,032 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-07 22:06:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-07 22:06:02,032 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-07 22:06:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:02,033 INFO L225 Difference]: With dead ends: 298 [2019-01-07 22:06:02,033 INFO L226 Difference]: Without dead ends: 199 [2019-01-07 22:06:02,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-07 22:06:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-07 22:06:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-07 22:06:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-07 22:06:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-07 22:06:02,037 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-07 22:06:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:02,037 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-07 22:06:02,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-07 22:06:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-07 22:06:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-07 22:06:02,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:02,038 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-07 22:06:02,038 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-07 22:06:02,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:02,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:06:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:02,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-07 22:06:05,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:05,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:06:05,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:06:05,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:06:05,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:05,843 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:06:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:06:05,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:06:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:05,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:06:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-07 22:06:06,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-07 22:06:16,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:16,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-07 22:06:16,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:16,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-07 22:06:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-07 22:06:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-07 22:06:16,916 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-07 22:06:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:18,142 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-07 22:06:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-07 22:06:18,142 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-07 22:06:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:18,143 INFO L225 Difference]: With dead ends: 301 [2019-01-07 22:06:18,143 INFO L226 Difference]: Without dead ends: 201 [2019-01-07 22:06:18,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-07 22:06:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-07 22:06:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-07 22:06:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-07 22:06:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-07 22:06:18,147 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-07 22:06:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-07 22:06:18,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-07 22:06:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-07 22:06:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-07 22:06:18,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:18,148 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-07 22:06:18,149 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-07 22:06:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:06:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:18,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-07 22:06:21,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:21,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:06:21,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:06:21,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:06:21,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:21,988 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:06:21,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:06:21,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:06:39,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-07 22:06:39,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:06:39,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:06:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-07 22:06:39,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-07 22:06:50,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:50,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-07 22:06:50,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:50,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-07 22:06:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-07 22:06:50,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-07 22:06:50,284 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-07 22:06:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:51,903 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-07 22:06:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-07 22:06:51,904 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-07 22:06:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:51,904 INFO L225 Difference]: With dead ends: 304 [2019-01-07 22:06:51,904 INFO L226 Difference]: Without dead ends: 203 [2019-01-07 22:06:51,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-07 22:06:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-07 22:06:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-07 22:06:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-07 22:06:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-07 22:06:51,909 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-07 22:06:51,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:51,909 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-07 22:06:51,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-07 22:06:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-07 22:06:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-07 22:06:51,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:51,910 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-07 22:06:51,910 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:51,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-07 22:06:51,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:51,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:06:51,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:51,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-07 22:06:55,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:55,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:06:55,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:06:55,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:06:55,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:55,541 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:06:55,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:06:55,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:06:55,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:06:55,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:06:55,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:06:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-07 22:06:55,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:07:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-07 22:07:06,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:07:06,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-07 22:07:06,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:07:06,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-07 22:07:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-07 22:07:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-07 22:07:06,847 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-07 22:07:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:07:08,484 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-07 22:07:08,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-07 22:07:08,484 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-07 22:07:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:07:08,485 INFO L225 Difference]: With dead ends: 307 [2019-01-07 22:07:08,485 INFO L226 Difference]: Without dead ends: 205 [2019-01-07 22:07:08,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-07 22:07:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-07 22:07:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-07 22:07:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-07 22:07:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-07 22:07:08,489 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-07 22:07:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:07:08,490 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-07 22:07:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-07 22:07:08,490 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-07 22:07:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-07 22:07:08,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:07:08,490 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-07 22:07:08,491 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:07:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:07:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-07 22:07:08,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:07:08,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:08,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:07:08,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:08,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:07:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-07 22:07:12,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:12,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:07:12,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:07:12,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:07:12,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:12,436 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:07:12,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:07:12,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:07:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:12,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:07:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-07 22:07:12,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:07:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-07 22:07:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:07:24,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-07 22:07:24,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:07:24,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-07 22:07:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-07 22:07:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-07 22:07:24,068 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-07 22:07:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:07:25,652 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-07 22:07:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-07 22:07:25,652 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-07 22:07:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:07:25,653 INFO L225 Difference]: With dead ends: 310 [2019-01-07 22:07:25,653 INFO L226 Difference]: Without dead ends: 207 [2019-01-07 22:07:25,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-07 22:07:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-07 22:07:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-07 22:07:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-07 22:07:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-07 22:07:25,659 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-07 22:07:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:07:25,659 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-07 22:07:25,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-07 22:07:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-07 22:07:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-07 22:07:25,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:07:25,660 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-07 22:07:25,661 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:07:25,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:07:25,661 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-07 22:07:25,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:07:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:25,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:07:25,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:25,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:07:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-07 22:07:29,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:29,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:07:29,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:07:29,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:07:29,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:29,634 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:07:29,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:07:29,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:07:50,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-07 22:07:50,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:07:50,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:07:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-07 22:07:50,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:08:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-07 22:08:02,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:08:02,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-07 22:08:02,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:08:02,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-07 22:08:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-07 22:08:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-07 22:08:02,525 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-07 22:08:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:08:04,311 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-07 22:08:04,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-07 22:08:04,311 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-07 22:08:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:08:04,312 INFO L225 Difference]: With dead ends: 313 [2019-01-07 22:08:04,312 INFO L226 Difference]: Without dead ends: 209 [2019-01-07 22:08:04,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-07 22:08:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-07 22:08:04,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-07 22:08:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-07 22:08:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-07 22:08:04,318 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-07 22:08:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:08:04,318 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-07 22:08:04,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-07 22:08:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-07 22:08:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-07 22:08:04,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:04,320 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-07 22:08:04,320 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:08:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:04,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-07 22:08:04,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:04,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:08:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:04,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:08:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-07 22:08:08,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:08:08,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:08:08,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:08:08,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:08:08,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:08:08,181 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:08:08,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:08:08,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:08:08,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:08:08,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:08:08,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:08:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-07 22:08:08,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:08:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-07 22:08:20,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:08:20,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-07 22:08:20,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:08:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-07 22:08:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-07 22:08:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-07 22:08:20,591 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-07 22:08:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:08:22,274 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-07 22:08:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-07 22:08:22,274 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-07 22:08:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:08:22,275 INFO L225 Difference]: With dead ends: 316 [2019-01-07 22:08:22,275 INFO L226 Difference]: Without dead ends: 211 [2019-01-07 22:08:22,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-07 22:08:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-07 22:08:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-07 22:08:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-07 22:08:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-07 22:08:22,281 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-07 22:08:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:08:22,282 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-07 22:08:22,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-07 22:08:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-07 22:08:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-07 22:08:22,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:22,283 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-07 22:08:22,283 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:08:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-07 22:08:22,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:22,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:08:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:22,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat