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/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:21:02,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:21:02,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:21:02,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:21:02,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:21:02,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:21:02,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:21:02,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:21:02,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:21:02,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:21:02,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:21:02,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:21:02,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:21:02,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:21:02,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:21:02,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:21:02,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:21:02,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:21:02,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:21:02,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:21:02,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:21:02,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:21:02,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:21:02,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:21:02,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:21:02,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:21:02,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:21:02,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:21:02,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:21:02,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:21:02,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:21:02,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:21:02,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:21:02,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:21:02,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:21:02,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:21:02,080 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-31 17:21:02,093 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:21:02,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:21:02,094 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:21:02,094 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:21:02,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:21:02,095 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:21:02,095 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:21:02,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:21:02,095 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:21:02,099 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:21:02,099 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:21:02,099 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:21:02,099 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:21:02,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:21:02,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:21:02,101 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:21:02,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:21:02,101 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:21:02,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:21:02,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:21:02,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:21:02,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:21:02,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:21:02,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:21:02,102 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:21:02,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:21:02,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:21:02,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:21:02,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:21:02,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:21:02,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:21:02,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:21:02,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:21:02,105 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:21:02,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:21:02,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:21:02,105 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:21:02,105 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:21:02,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:21:02,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:21:02,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:21:02,152 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:21:02,153 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:21:02,154 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-01-31 17:21:02,154 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-01-31 17:21:02,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:21:02,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:21:02,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:21:02,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:21:02,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:02,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:21:02,231 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:21:02,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... [2019-01-31 17:21:02,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:21:02,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:21:02,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:21:02,252 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:21:02,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:02,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:21:02,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:21:02,563 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:21:02,563 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 17:21:02,565 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02 BoogieIcfgContainer [2019-01-31 17:21:02,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:21:02,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:21:02,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:21:02,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:21:02,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:02" (1/2) ... [2019-01-31 17:21:02,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a501ce and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:21:02, skipping insertion in model container [2019-01-31 17:21:02,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:02" (2/2) ... [2019-01-31 17:21:02,575 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-01-31 17:21:02,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:21:02,595 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 17:21:02,626 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 17:21:02,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:21:02,668 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:21:02,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:21:02,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:21:02,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:21:02,669 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:21:02,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:21:02,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:21:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 17:21:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:21:02,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:02,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:21:02,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-31 17:21:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:02,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:02,850 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-31 17:21:02,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:02,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:21:02,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:02,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:21:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:21:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:21:02,869 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 17:21:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:02,915 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 17:21:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:21:02,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:21:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:02,929 INFO L225 Difference]: With dead ends: 9 [2019-01-31 17:21:02,930 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 17:21:02,934 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-31 17:21:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 17:21:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 17:21:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 17:21:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 17:21:02,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 17:21:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:02,970 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 17:21:02,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:21:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 17:21:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:21:02,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:02,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:21:02,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:02,972 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-31 17:21:02,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:02,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:02,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:03,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:03,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:03,150 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:21:03,152 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-31 17:21:03,238 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:03,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:04,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:04,565 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:21:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:04,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:04,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:04,581 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-31 17:21:04,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:04,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:04,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:04,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:04,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:04,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 17:21:04,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:04,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:04,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:04,790 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-31 17:21:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:04,839 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 17:21:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:21:04,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:21:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:04,840 INFO L225 Difference]: With dead ends: 8 [2019-01-31 17:21:04,840 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 17:21:04,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-31 17:21:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 17:21:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 17:21:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 17:21:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 17:21:04,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 17:21:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:04,845 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 17:21:04,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 17:21:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:21:04,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:04,846 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:21:04,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-31 17:21:04,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:04,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:04,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:04,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:05,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:05,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:05,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:05,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:05,014 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-31 17:21:05,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:05,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:05,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:21:05,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:05,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:05,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-31 17:21:05,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:05,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:21:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:21:05,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:05,158 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-31 17:21:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:05,213 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 17:21:05,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:21:05,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 17:21:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:05,214 INFO L225 Difference]: With dead ends: 9 [2019-01-31 17:21:05,214 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 17:21:05,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 17:21:05,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 17:21:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 17:21:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 17:21:05,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-31 17:21:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:05,218 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 17:21:05,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:21:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 17:21:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:21:05,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:05,219 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 17:21:05,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-31 17:21:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:05,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:05,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:05,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:05,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:05,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:05,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:05,620 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-31 17:21:05,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:05,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:05,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:05,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:05,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:05,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:05,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 17:21:05,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:05,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:21:05,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:21:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:05,986 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-31 17:21:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,019 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 17:21:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:21:06,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-31 17:21:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,020 INFO L225 Difference]: With dead ends: 10 [2019-01-31 17:21:06,020 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 17:21:06,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 17:21:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 17:21:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:21:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 17:21:06,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-31 17:21:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,024 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 17:21:06,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:21:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 17:21:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:21:06,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,025 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-31 17:21:06,025 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-31 17:21:06,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:06,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:06,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:06,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:06,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,259 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-31 17:21:06,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:06,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:06,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:06,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:06,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-31 17:21:06,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:06,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:21:06,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:21:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:06,466 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-31 17:21:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:06,493 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 17:21:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:21:06,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:21:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:06,493 INFO L225 Difference]: With dead ends: 11 [2019-01-31 17:21:06,494 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 17:21:06,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 17:21:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 17:21:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 17:21:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-31 17:21:06,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-31 17:21:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:06,497 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-31 17:21:06,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:21:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 17:21:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:21:06,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:06,498 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-31 17:21:06,498 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-31 17:21:06,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:06,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:06,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:06,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:06,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:06,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:06,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:06,574 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-31 17:21:06,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:06,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:06,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:21:06,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:06,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:06,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:07,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-31 17:21:07,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:07,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:21:07,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:21:07,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:07,250 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-31 17:21:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:07,287 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 17:21:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:21:07,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-31 17:21:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:07,290 INFO L225 Difference]: With dead ends: 12 [2019-01-31 17:21:07,290 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 17:21:07,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 17:21:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-31 17:21:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:21:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-31 17:21:07,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-31 17:21:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-31 17:21:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:21:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 17:21:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:21:07,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:07,294 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-31 17:21:07,294 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-31 17:21:07,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:07,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:07,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:07,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,395 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-31 17:21:07,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:07,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:07,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:07,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:07,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:07,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-31 17:21:07,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:07,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:21:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:21:07,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:07,638 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-31 17:21:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:07,665 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-31 17:21:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:21:07,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-31 17:21:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:07,666 INFO L225 Difference]: With dead ends: 13 [2019-01-31 17:21:07,666 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 17:21:07,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:21:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 17:21:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 17:21:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:21:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-31 17:21:07,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-31 17:21:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:07,671 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-31 17:21:07,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:21:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 17:21:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:21:07,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:07,672 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-31 17:21:07,672 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-31 17:21:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:07,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:07,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:07,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:07,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:07,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 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-31 17:21:07,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:07,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:07,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:07,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-31 17:21:08,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:21:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:21:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:08,223 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-31 17:21:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:08,256 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-31 17:21:08,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:21:08,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-31 17:21:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:08,258 INFO L225 Difference]: With dead ends: 14 [2019-01-31 17:21:08,258 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 17:21:08,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 17:21:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 17:21:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:21:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-31 17:21:08,261 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-31 17:21:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:08,261 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-31 17:21:08,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:21:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 17:21:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 17:21:08,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:08,262 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-31 17:21:08,262 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-31 17:21:08,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:08,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:08,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:08,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,364 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-31 17:21:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:08,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:08,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 17:21:08,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:08,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:08,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-31 17:21:08,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:08,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:21:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:21:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:21:08,689 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-31 17:21:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:08,715 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-31 17:21:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:21:08,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-31 17:21:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:08,716 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:21:08,716 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 17:21:08,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:21:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 17:21:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 17:21:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:21:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-31 17:21:08,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-31 17:21:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:08,720 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-31 17:21:08,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:21:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-31 17:21:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 17:21:08,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:08,721 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-31 17:21:08,721 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-31 17:21:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:08,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:08,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:08,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:08,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:08,866 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-31 17:21:08,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:08,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:08,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:08,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:08,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:08,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-31 17:21:09,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:21:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:21:09,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:09,112 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-31 17:21:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:09,136 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-31 17:21:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:21:09,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-31 17:21:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:09,137 INFO L225 Difference]: With dead ends: 16 [2019-01-31 17:21:09,137 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:21:09,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:21:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-31 17:21:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:21:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-31 17:21:09,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-31 17:21:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:09,141 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-31 17:21:09,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:21:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-31 17:21:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-31 17:21:09,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:09,142 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-31 17:21:09,142 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-31 17:21:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:21:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:09,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:09,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-31 17:21:09,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:09,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:21:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:21:09,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:21:09,543 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-31 17:21:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:09,573 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-31 17:21:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:21:09,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-31 17:21:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:09,574 INFO L225 Difference]: With dead ends: 17 [2019-01-31 17:21:09,574 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 17:21:09,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:21:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 17:21:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 17:21:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 17:21:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-31 17:21:09,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-31 17:21:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:09,579 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-31 17:21:09,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:21:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-31 17:21:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 17:21:09,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:09,580 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-31 17:21:09,580 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:09,580 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-31 17:21:09,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:09,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:09,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:09,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:09,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:09,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:09,891 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-31 17:21:09,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:09,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:09,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 17:21:09,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:09,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:09,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:10,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-31 17:21:10,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:10,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:21:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:21:10,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 17:21:10,555 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-31 17:21:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:10,585 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-31 17:21:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 17:21:10,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-31 17:21:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:10,586 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:21:10,586 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 17:21:10,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 17:21:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 17:21:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-31 17:21:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:21:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-31 17:21:10,590 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-31 17:21:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:10,591 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-31 17:21:10,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:21:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-31 17:21:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-31 17:21:10,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:10,591 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-31 17:21:10,592 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-31 17:21:10,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:10,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:10,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:10,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:10,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:10,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:10,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:10,725 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-31 17:21:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:10,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:10,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:10,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:10,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:10,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:11,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-31 17:21:11,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:11,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 17:21:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 17:21:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:11,235 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-31 17:21:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:11,279 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-31 17:21:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 17:21:11,287 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-31 17:21:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:11,288 INFO L225 Difference]: With dead ends: 19 [2019-01-31 17:21:11,288 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:21:11,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 17:21:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:21:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:21:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:21:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-31 17:21:11,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-31 17:21:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:11,295 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-31 17:21:11,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 17:21:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-31 17:21:11,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 17:21:11,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:11,296 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-31 17:21:11,296 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-31 17:21:11,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:11,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:11,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:11,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:11,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:11,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:11,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:11,546 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-31 17:21:11,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:11,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:11,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-31 17:21:11,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:11,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 17:21:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 17:21:11,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 17:21:11,964 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-31 17:21:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:12,011 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-31 17:21:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 17:21:12,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-31 17:21:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:12,014 INFO L225 Difference]: With dead ends: 20 [2019-01-31 17:21:12,014 INFO L226 Difference]: Without dead ends: 18 [2019-01-31 17:21:12,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 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-31 17:21:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-31 17:21:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-31 17:21:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:21:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-31 17:21:12,018 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-31 17:21:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:12,018 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-31 17:21:12,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 17:21:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-31 17:21:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-31 17:21:12,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:12,019 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-31 17:21:12,019 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-31 17:21:12,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:12,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:12,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:12,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:12,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,235 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-31 17:21:12,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:12,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:12,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 17:21:12,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:12,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:12,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:12,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:12,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-31 17:21:12,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:12,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 17:21:12,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 17:21:12,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:21:12,612 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-31 17:21:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:12,660 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-31 17:21:12,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 17:21:12,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-31 17:21:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:12,662 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:21:12,662 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:21:12,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:21:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:21:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 17:21:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 17:21:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-31 17:21:12,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-31 17:21:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:12,667 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-31 17:21:12,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 17:21:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-31 17:21:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 17:21:12,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:12,668 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-31 17:21:12,668 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-31 17:21:12,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:12,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:12,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:12,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:12,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:12,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:12,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:12,912 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-31 17:21:12,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:12,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:12,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:12,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:12,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:12,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:13,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:13,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-31 17:21:13,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:13,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 17:21:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 17:21:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:13,394 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-31 17:21:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:13,441 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-31 17:21:13,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 17:21:13,441 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-31 17:21:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:13,442 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:21:13,443 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:21:13,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 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-31 17:21:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:21:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-31 17:21:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:21:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-31 17:21:13,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-31 17:21:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:13,447 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-31 17:21:13,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 17:21:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-31 17:21:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-31 17:21:13,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:13,447 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-31 17:21:13,448 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-31 17:21:13,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:13,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:13,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:13,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:14,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:14,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:14,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:14,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:14,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:14,213 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-31 17:21:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:14,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:14,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:14,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:14,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:14,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-31 17:21:14,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:14,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 17:21:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 17:21:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:14,872 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-31 17:21:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:14,899 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-31 17:21:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 17:21:14,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-31 17:21:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:14,901 INFO L225 Difference]: With dead ends: 23 [2019-01-31 17:21:14,901 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:21:14,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 17:21:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:21:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 17:21:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:21:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-31 17:21:14,904 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-31 17:21:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:14,904 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-31 17:21:14,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 17:21:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-31 17:21:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 17:21:14,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:14,905 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-31 17:21:14,905 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-31 17:21:14,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:14,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:14,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:14,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:14,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:15,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:15,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:15,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:15,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:15,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:15,114 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-31 17:21:15,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:15,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:15,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 17:21:15,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:15,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:15,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:16,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-31 17:21:16,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:16,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 17:21:16,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 17:21:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:21:16,353 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-31 17:21:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:16,381 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-31 17:21:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 17:21:16,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-31 17:21:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:16,382 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:21:16,382 INFO L226 Difference]: Without dead ends: 22 [2019-01-31 17:21:16,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:21:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-31 17:21:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-31 17:21:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:21:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-31 17:21:16,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-31 17:21:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:16,389 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-31 17:21:16,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 17:21:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-31 17:21:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-31 17:21:16,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:16,390 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-31 17:21:16,390 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-31 17:21:16,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:16,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:16,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:17,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:17,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:17,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:17,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:17,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:17,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 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-31 17:21:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:17,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:17,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:17,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:17,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:17,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-31 17:21:17,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:17,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 17:21:17,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 17:21:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:17,526 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-31 17:21:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:17,563 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-31 17:21:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 17:21:17,563 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-31 17:21:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:17,564 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:21:17,564 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:21:17,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:21:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:21:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 17:21:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:21:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-31 17:21:17,569 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-31 17:21:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:17,569 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-31 17:21:17,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 17:21:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-31 17:21:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 17:21:17,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:17,570 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-31 17:21:17,570 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:17,571 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-31 17:21:17,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:17,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:17,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:17,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:17,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:17,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:17,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:17,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:17,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:17,815 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-31 17:21:17,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:17,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:17,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:17,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:18,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:18,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-31 17:21:18,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:18,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 17:21:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 17:21:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:21:18,427 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-31 17:21:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:18,472 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-31 17:21:18,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 17:21:18,475 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-31 17:21:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:18,476 INFO L225 Difference]: With dead ends: 26 [2019-01-31 17:21:18,476 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:21:18,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:21:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:21:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-31 17:21:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:21:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-31 17:21:18,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-31 17:21:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:18,480 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-31 17:21:18,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 17:21:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-31 17:21:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-31 17:21:18,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:18,481 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-31 17:21:18,481 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-31 17:21:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:18,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:18,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:18,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:18,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:18,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:18,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:18,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:18,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:18,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:18,718 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-31 17:21:18,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:18,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:18,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 17:21:18,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:18,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:18,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:19,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:19,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-31 17:21:19,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:19,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 17:21:19,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 17:21:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:21:19,320 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-31 17:21:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:19,368 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-31 17:21:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 17:21:19,369 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-31 17:21:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:19,369 INFO L225 Difference]: With dead ends: 27 [2019-01-31 17:21:19,370 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 17:21:19,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:21:19,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 17:21:19,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 17:21:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:21:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-31 17:21:19,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-31 17:21:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:19,374 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-31 17:21:19,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 17:21:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-31 17:21:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 17:21:19,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:19,375 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-31 17:21:19,375 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-31 17:21:19,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:19,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:19,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:19,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:19,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:19,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:19,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:19,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:19,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:19,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:19,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:21:19,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:19,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:19,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:19,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:19,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:19,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:20,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:20,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-31 17:21:20,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:20,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 17:21:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 17:21:20,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:20,757 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-31 17:21:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:20,818 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-31 17:21:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 17:21:20,820 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-31 17:21:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:20,821 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:21:20,821 INFO L226 Difference]: Without dead ends: 26 [2019-01-31 17:21:20,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 17:21:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-31 17:21:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-31 17:21:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:21:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-31 17:21:20,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-31 17:21:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:20,825 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-31 17:21:20,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 17:21:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-31 17:21:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-31 17:21:20,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:20,826 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-31 17:21:20,827 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:20,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-31 17:21:20,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:20,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:20,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:20,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:20,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:21,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:21,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:21,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:21,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:21,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:21,623 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-31 17:21:21,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:21,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:21,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:21,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:22,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:22,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-31 17:21:22,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:22,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 17:21:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 17:21:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 17:21:22,287 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-31 17:21:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:22,322 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-31 17:21:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 17:21:22,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-31 17:21:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:22,324 INFO L225 Difference]: With dead ends: 29 [2019-01-31 17:21:22,325 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 17:21:22,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 17:21:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 17:21:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 17:21:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 17:21:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-31 17:21:22,329 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-31 17:21:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:22,330 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-31 17:21:22,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 17:21:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-31 17:21:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 17:21:22,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:22,331 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-31 17:21:22,331 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-31 17:21:22,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:22,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:22,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:22,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:22,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:22,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:22,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:22,694 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-31 17:21:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:22,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:22,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 17:21:22,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:22,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:22,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:23,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:23,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-31 17:21:23,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:23,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 17:21:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 17:21:23,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:21:23,431 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-31 17:21:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:23,478 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-31 17:21:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 17:21:23,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-31 17:21:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:23,479 INFO L225 Difference]: With dead ends: 30 [2019-01-31 17:21:23,479 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 17:21:23,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 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-31 17:21:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 17:21:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-31 17:21:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:21:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-31 17:21:23,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-31 17:21:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:23,485 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-31 17:21:23,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 17:21:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-31 17:21:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-31 17:21:23,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:23,486 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-31 17:21:23,486 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-31 17:21:23,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:23,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:23,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:23,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:23,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:23,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:23,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:23,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:23,950 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-31 17:21:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:23,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:23,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:23,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:23,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:23,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:24,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:24,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-31 17:21:24,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:24,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 17:21:24,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 17:21:24,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:24,670 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-31 17:21:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:24,726 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-31 17:21:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 17:21:24,727 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-31 17:21:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:24,727 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:21:24,727 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:21:24,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 17:21:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:21:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 17:21:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:21:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-31 17:21:24,733 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-31 17:21:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:24,733 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-31 17:21:24,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 17:21:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-31 17:21:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 17:21:24,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:24,734 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-31 17:21:24,734 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-31 17:21:24,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:24,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:24,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:24,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:25,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:25,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:25,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:25,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:25,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 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-31 17:21:25,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:25,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:25,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:25,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-31 17:21:26,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:26,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 17:21:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 17:21:26,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 17:21:26,896 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-31 17:21:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:26,997 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-31 17:21:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 17:21:26,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-31 17:21:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:26,998 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:21:26,998 INFO L226 Difference]: Without dead ends: 30 [2019-01-31 17:21:26,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 17:21:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-31 17:21:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-31 17:21:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:21:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-31 17:21:27,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-31 17:21:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:27,001 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-31 17:21:27,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 17:21:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-31 17:21:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-31 17:21:27,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:27,002 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-31 17:21:27,002 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-31 17:21:27,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:27,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:27,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:27,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:27,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:27,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:27,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:27,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:27,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:27,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 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-31 17:21:27,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:27,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:27,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 17:21:27,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:27,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:27,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:28,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-31 17:21:28,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:28,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 17:21:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 17:21:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 17:21:28,818 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-31 17:21:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:29,038 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-31 17:21:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 17:21:29,039 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-31 17:21:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:29,039 INFO L225 Difference]: With dead ends: 33 [2019-01-31 17:21:29,039 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:21:29,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 17:21:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:21:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 17:21:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:21:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-31 17:21:29,043 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-31 17:21:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:29,044 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-31 17:21:29,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 17:21:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-31 17:21:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 17:21:29,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:29,045 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-31 17:21:29,045 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-31 17:21:29,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:29,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:29,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:29,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:29,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:29,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:29,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:29,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:29,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 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-31 17:21:29,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:29,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:29,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:29,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:29,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:29,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:30,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:30,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-31 17:21:30,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:30,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 17:21:30,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 17:21:30,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:30,541 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-31 17:21:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:30,595 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-31 17:21:30,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 17:21:30,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-31 17:21:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:30,596 INFO L225 Difference]: With dead ends: 34 [2019-01-31 17:21:30,597 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 17:21:30,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:21:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 17:21:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-31 17:21:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:21:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-31 17:21:30,602 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-31 17:21:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:30,602 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-31 17:21:30,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 17:21:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-31 17:21:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-31 17:21:30,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:30,603 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-31 17:21:30,603 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-31 17:21:30,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:30,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:30,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:30,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:31,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:31,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:31,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:31,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:31,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:31,226 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-31 17:21:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:31,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:31,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:31,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:32,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:32,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-31 17:21:32,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:32,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 17:21:32,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 17:21:32,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:21:32,203 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-31 17:21:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:32,277 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-31 17:21:32,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 17:21:32,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-31 17:21:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:32,278 INFO L225 Difference]: With dead ends: 35 [2019-01-31 17:21:32,278 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:21:32,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:21:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:21:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 17:21:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:21:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-31 17:21:32,281 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-31 17:21:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:32,282 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-31 17:21:32,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 17:21:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-31 17:21:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 17:21:32,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:32,283 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-31 17:21:32,283 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-31 17:21:32,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:32,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:32,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:32,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:32,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:32,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:32,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:32,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:32,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:32,746 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-31 17:21:32,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:32,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:32,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 17:21:32,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:32,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:32,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:33,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:33,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-31 17:21:33,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:33,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 17:21:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 17:21:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:21:33,961 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-31 17:21:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:34,017 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-31 17:21:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 17:21:34,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-31 17:21:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:34,019 INFO L225 Difference]: With dead ends: 36 [2019-01-31 17:21:34,019 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 17:21:34,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:21:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 17:21:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-31 17:21:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 17:21:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-31 17:21:34,022 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-31 17:21:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:34,022 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-31 17:21:34,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 17:21:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-31 17:21:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-31 17:21:34,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:34,023 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-31 17:21:34,023 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-31 17:21:34,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:34,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:34,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:34,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:34,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:34,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:34,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:34,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:34,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:21:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:34,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:34,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:34,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:34,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:34,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:35,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:35,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-31 17:21:35,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:35,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 17:21:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 17:21:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:35,668 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-31 17:21:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:35,778 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-31 17:21:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 17:21:35,779 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-31 17:21:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:35,779 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:21:35,779 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:21:35,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 17:21:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:21:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 17:21:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:21:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-31 17:21:35,783 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-31 17:21:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:35,783 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-31 17:21:35,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 17:21:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-31 17:21:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 17:21:35,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:35,784 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-31 17:21:35,784 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:35,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-31 17:21:35,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:35,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:35,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:36,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:36,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:36,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:36,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:36,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:36,355 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-31 17:21:36,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:36,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:36,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:36,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:37,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:37,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-31 17:21:37,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:37,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 17:21:37,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 17:21:37,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 17:21:37,568 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-31 17:21:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:37,636 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-31 17:21:37,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 17:21:37,636 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-31 17:21:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:37,637 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:21:37,637 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:21:37,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 17:21:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:21:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-31 17:21:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:21:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-31 17:21:37,641 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-31 17:21:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:37,642 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-31 17:21:37,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 17:21:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-31 17:21:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-31 17:21:37,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:37,643 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-31 17:21:37,643 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-31 17:21:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:37,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:38,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:38,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:38,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:38,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:38,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:38,122 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-31 17:21:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:38,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:38,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 17:21:38,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:38,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:38,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:39,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:39,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-31 17:21:39,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:39,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 17:21:39,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 17:21:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 17:21:39,418 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-31 17:21:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:39,485 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-31 17:21:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 17:21:39,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-31 17:21:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:39,486 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:21:39,486 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:21:39,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 17:21:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:21:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 17:21:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:21:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-31 17:21:39,491 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-31 17:21:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:39,491 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-31 17:21:39,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 17:21:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-31 17:21:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 17:21:39,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:39,491 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-31 17:21:39,492 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-31 17:21:39,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:39,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:39,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:39,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:40,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:40,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:40,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:40,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:40,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:40,258 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-31 17:21:40,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:40,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:40,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:40,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:40,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:40,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-31 17:21:41,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:41,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 17:21:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 17:21:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:41,938 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-31 17:21:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:42,044 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-31 17:21:42,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 17:21:42,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-31 17:21:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:42,046 INFO L225 Difference]: With dead ends: 40 [2019-01-31 17:21:42,046 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:21:42,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:21:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:21:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-31 17:21:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:21:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-31 17:21:42,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-31 17:21:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:42,048 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-31 17:21:42,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 17:21:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-31 17:21:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-31 17:21:42,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:42,049 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-31 17:21:42,049 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:42,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-31 17:21:42,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:42,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:42,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:43,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:43,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:43,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:43,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:43,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:43,687 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-31 17:21:43,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:43,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:43,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:43,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:44,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-31 17:21:44,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:44,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 17:21:44,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 17:21:44,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 17:21:44,985 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-31 17:21:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:45,058 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-31 17:21:45,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 17:21:45,059 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-31 17:21:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:45,059 INFO L225 Difference]: With dead ends: 41 [2019-01-31 17:21:45,060 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 17:21:45,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 17:21:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 17:21:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 17:21:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:21:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-31 17:21:45,064 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-31 17:21:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:45,064 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-31 17:21:45,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 17:21:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-31 17:21:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 17:21:45,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:45,065 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-31 17:21:45,065 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-31 17:21:45,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:45,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:45,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:45,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:45,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:45,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:45,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:45,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:45,603 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-31 17:21:45,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:45,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:45,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 17:21:45,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:45,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:45,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:47,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:47,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-31 17:21:47,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:47,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 17:21:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 17:21:47,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:21:47,539 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-31 17:21:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:47,591 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-31 17:21:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 17:21:47,592 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-31 17:21:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:47,592 INFO L225 Difference]: With dead ends: 42 [2019-01-31 17:21:47,592 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:21:47,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:21:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:21:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-31 17:21:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:21:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-31 17:21:47,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-31 17:21:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:47,597 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-31 17:21:47,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 17:21:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-31 17:21:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-31 17:21:47,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:47,597 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-31 17:21:47,598 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-31 17:21:47,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:47,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:47,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:48,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:48,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,418 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-31 17:21:48,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:48,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:48,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:48,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:48,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:48,471 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:49,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:49,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-31 17:21:49,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:49,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 17:21:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 17:21:49,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:21:49,919 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-31 17:21:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:49,976 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-31 17:21:49,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 17:21:49,977 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-31 17:21:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:49,977 INFO L225 Difference]: With dead ends: 43 [2019-01-31 17:21:49,978 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 17:21:49,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 17:21:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 17:21:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 17:21:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:21:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-31 17:21:49,981 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-31 17:21:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:49,981 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-31 17:21:49,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 17:21:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-31 17:21:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 17:21:49,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:49,982 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-31 17:21:49,982 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-31 17:21:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:49,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:49,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:50,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:50,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:50,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,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 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-31 17:21:50,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:50,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:52,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-31 17:21:52,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:52,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 17:21:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 17:21:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:21:52,480 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-31 17:21:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:52,556 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-31 17:21:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 17:21:52,557 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-31 17:21:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:52,557 INFO L225 Difference]: With dead ends: 44 [2019-01-31 17:21:52,557 INFO L226 Difference]: Without dead ends: 42 [2019-01-31 17:21:52,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:21:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-31 17:21:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-31 17:21:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 17:21:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-31 17:21:52,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-31 17:21:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:52,560 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-31 17:21:52,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 17:21:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-31 17:21:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-31 17:21:52,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:52,561 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-31 17:21:52,561 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:52,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-31 17:21:52,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:53,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:53,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:53,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:53,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:53,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:53,208 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-31 17:21:53,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:53,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:53,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 17:21:53,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:53,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:53,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:55,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:55,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-31 17:21:55,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:55,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 17:21:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 17:21:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:21:55,128 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-31 17:21:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:55,188 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-31 17:21:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 17:21:55,188 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-31 17:21:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:55,189 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:21:55,189 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 17:21:55,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:21:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 17:21:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 17:21:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 17:21:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-31 17:21:55,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-31 17:21:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:55,194 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-31 17:21:55,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 17:21:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-31 17:21:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 17:21:55,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:55,194 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-31 17:21:55,195 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:55,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-31 17:21:55,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:55,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:55,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:55,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:55,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:55,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:55,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:55,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:55,917 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-31 17:21:55,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:55,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:55,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:55,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:55,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:55,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:57,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:57,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-31 17:21:57,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:57,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 17:21:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 17:21:57,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 17:21:57,887 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-31 17:21:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:57,959 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-31 17:21:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 17:21:57,959 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-31 17:21:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:57,960 INFO L225 Difference]: With dead ends: 46 [2019-01-31 17:21:57,960 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:21:57,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 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-31 17:21:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:21:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-31 17:21:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-31 17:21:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-31 17:21:57,964 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-31 17:21:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:57,964 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-31 17:21:57,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 17:21:57,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-31 17:21:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-31 17:21:57,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:57,964 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-31 17:21:57,964 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-31 17:21:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:57,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:57,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:57,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:57,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:58,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:58,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:58,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:58,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:58,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:58,674 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-31 17:21:58,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:58,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:58,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:58,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:00,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:00,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-31 17:22:00,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:00,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 17:22:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 17:22:00,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 17:22:00,463 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-31 17:22:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:00,563 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-31 17:22:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 17:22:00,564 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-31 17:22:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:00,565 INFO L225 Difference]: With dead ends: 47 [2019-01-31 17:22:00,565 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:22:00,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 17:22:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:22:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 17:22:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 17:22:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-31 17:22:00,567 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-31 17:22:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:00,567 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-31 17:22:00,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 17:22:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-31 17:22:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 17:22:00,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:00,568 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-31 17:22:00,568 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-31 17:22:00,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:00,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:00,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:01,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:01,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:01,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:01,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,647 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-31 17:22:01,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:01,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:01,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 17:22:01,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:01,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:01,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:03,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-31 17:22:03,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:03,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 17:22:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 17:22:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:22:03,624 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-31 17:22:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:03,699 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-31 17:22:03,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 17:22:03,699 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-31 17:22:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:03,700 INFO L225 Difference]: With dead ends: 48 [2019-01-31 17:22:03,700 INFO L226 Difference]: Without dead ends: 46 [2019-01-31 17:22:03,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:22:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-31 17:22:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-31 17:22:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:22:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-31 17:22:03,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-31 17:22:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:03,704 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-31 17:22:03,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 17:22:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-31 17:22:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-31 17:22:03,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:03,704 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-31 17:22:03,704 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-31 17:22:03,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:03,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:03,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:03,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:04,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:04,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:04,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:04,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:04,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:04,437 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-31 17:22:04,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:04,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:04,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:04,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:04,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:04,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:06,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:06,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-31 17:22:06,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 17:22:06,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 17:22:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:06,706 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-31 17:22:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:06,818 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-31 17:22:06,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 17:22:06,819 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-31 17:22:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:06,820 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:22:06,820 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:22:06,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 17:22:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:22:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 17:22:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:22:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-31 17:22:06,824 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-31 17:22:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:06,824 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-31 17:22:06,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 17:22:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-31 17:22:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 17:22:06,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:06,825 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-31 17:22:06,825 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-31 17:22:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:06,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:06,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:07,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:07,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:07,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:07,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:07,643 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-31 17:22:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:07,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:07,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:07,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:09,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:09,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-31 17:22:09,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:09,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 17:22:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 17:22:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 17:22:09,682 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-31 17:22:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:09,830 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-31 17:22:09,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 17:22:09,831 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-31 17:22:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:09,831 INFO L225 Difference]: With dead ends: 50 [2019-01-31 17:22:09,831 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:22:09,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 17:22:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:22:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-31 17:22:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:22:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-31 17:22:09,834 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-31 17:22:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:09,834 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-31 17:22:09,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 17:22:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-31 17:22:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-31 17:22:09,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:09,835 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-31 17:22:09,835 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:09,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-31 17:22:09,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:09,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:09,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:10,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:10,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:10,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:10,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:10,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:10,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 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-31 17:22:10,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:10,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:10,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 17:22:10,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:10,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:10,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-31 17:22:13,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:13,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:22:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:22:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:22:13,254 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-31 17:22:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:13,310 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-31 17:22:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 17:22:13,310 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-31 17:22:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:13,311 INFO L225 Difference]: With dead ends: 51 [2019-01-31 17:22:13,311 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 17:22:13,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:22:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 17:22:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 17:22:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 17:22:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-31 17:22:13,314 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-31 17:22:13,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:13,315 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-31 17:22:13,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:22:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-31 17:22:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 17:22:13,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:13,315 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-31 17:22:13,316 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-31 17:22:13,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:13,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:13,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:13,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:14,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:14,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:14,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:14,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:14,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:14,219 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-31 17:22:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:14,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:14,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:14,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:14,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:14,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:16,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-31 17:22:16,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:16,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 17:22:16,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 17:22:16,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:16,481 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-31 17:22:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:16,711 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-31 17:22:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 17:22:16,711 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-31 17:22:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:16,712 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:22:16,712 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:22:16,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:22:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:22:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-31 17:22:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:22:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-31 17:22:16,715 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-31 17:22:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:16,715 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-31 17:22:16,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 17:22:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-31 17:22:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-31 17:22:16,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:16,716 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-31 17:22:16,716 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-31 17:22:16,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:16,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:16,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:17,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:17,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:17,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:17,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:17,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:17,852 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-31 17:22:17,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:17,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:17,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:17,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:20,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:20,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-31 17:22:20,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:20,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 17:22:20,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 17:22:20,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 17:22:20,199 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-31 17:22:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:20,291 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-31 17:22:20,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 17:22:20,292 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-31 17:22:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:20,293 INFO L225 Difference]: With dead ends: 53 [2019-01-31 17:22:20,293 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:22:20,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 17:22:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:22:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 17:22:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:22:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-31 17:22:20,296 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-31 17:22:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:20,296 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-31 17:22:20,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 17:22:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-31 17:22:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 17:22:20,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:20,297 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-31 17:22:20,297 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-31 17:22:20,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:20,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:20,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:20,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:21,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:21,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:21,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:21,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:21,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:21,533 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-31 17:22:21,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:21,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:21,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 17:22:21,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:21,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:21,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:24,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:24,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-31 17:22:24,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:24,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 17:22:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 17:22:24,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:22:24,576 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-31 17:22:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:24,636 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-31 17:22:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 17:22:24,636 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-31 17:22:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:24,637 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:22:24,637 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:22:24,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:22:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:22:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-31 17:22:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 17:22:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-31 17:22:24,641 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-31 17:22:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:24,642 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-31 17:22:24,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 17:22:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-31 17:22:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 17:22:24,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:24,642 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-31 17:22:24,643 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-31 17:22:24,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:24,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:24,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:24,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:24,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:25,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:25,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:25,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:25,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:25,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:25,558 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-31 17:22:25,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:25,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:25,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:25,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:25,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:25,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:28,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:28,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-31 17:22:28,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:28,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 17:22:28,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 17:22:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:28,399 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-31 17:22:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:28,561 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-31 17:22:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 17:22:28,562 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-31 17:22:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:28,563 INFO L225 Difference]: With dead ends: 55 [2019-01-31 17:22:28,563 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:22:28,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 17:22:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:22:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 17:22:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:22:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-31 17:22:28,567 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-31 17:22:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:28,567 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-31 17:22:28,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 17:22:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-31 17:22:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 17:22:28,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:28,568 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-31 17:22:28,568 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:28,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-31 17:22:28,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:28,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:28,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:28,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:28,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:29,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:29,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:29,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:29,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:29,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:29,554 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-31 17:22:29,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:29,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:29,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:29,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:32,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-31 17:22:32,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:32,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 17:22:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 17:22:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:22:32,480 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-31 17:22:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:32,541 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-31 17:22:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 17:22:32,541 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-31 17:22:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:32,542 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:22:32,542 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 17:22:32,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:22:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 17:22:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-31 17:22:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 17:22:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-31 17:22:32,546 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-31 17:22:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:32,546 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-31 17:22:32,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 17:22:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-31 17:22:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-31 17:22:32,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:32,547 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-31 17:22:32,547 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:32,547 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-31 17:22:32,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:32,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:32,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:32,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:32,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:33,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:33,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:33,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:33,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:33,547 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-31 17:22:33,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:33,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:33,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 17:22:33,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:33,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:33,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:36,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:36,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-31 17:22:36,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:36,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:22:36,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:22:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:22:36,569 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-31 17:22:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:36,736 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-31 17:22:36,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 17:22:36,736 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-31 17:22:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:36,737 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:22:36,737 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:22:36,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:22:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:22:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 17:22:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:22:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-31 17:22:36,739 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-31 17:22:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:36,739 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-31 17:22:36,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:22:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-31 17:22:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 17:22:36,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:36,740 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-31 17:22:36,740 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:36,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:36,740 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-31 17:22:36,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:36,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:36,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:38,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:38,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:38,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:38,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:38,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:38,040 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-31 17:22:38,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:38,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:38,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:38,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:38,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:38,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:40,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:40,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-31 17:22:40,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:40,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 17:22:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 17:22:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:22:40,897 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-31 17:22:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:40,995 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-31 17:22:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 17:22:40,995 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-31 17:22:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:40,996 INFO L225 Difference]: With dead ends: 58 [2019-01-31 17:22:40,996 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:22:40,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:22:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:22:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-31 17:22:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 17:22:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-31 17:22:40,998 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-31 17:22:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:40,998 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-31 17:22:40,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 17:22:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-31 17:22:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 17:22:40,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:40,999 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-31 17:22:40,999 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:40,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-31 17:22:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:41,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:41,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:41,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:41,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:42,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:42,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:42,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:42,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:42,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:42,088 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-31 17:22:42,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:42,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:42,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:42,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:45,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:45,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-31 17:22:45,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:45,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 17:22:45,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 17:22:45,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 17:22:45,337 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-31 17:22:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:45,433 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-31 17:22:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 17:22:45,433 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-31 17:22:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:45,434 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:22:45,434 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:22:45,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 17:22:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:22:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 17:22:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 17:22:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-31 17:22:45,437 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-31 17:22:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:45,437 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-31 17:22:45,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 17:22:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-31 17:22:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 17:22:45,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:45,438 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-31 17:22:45,438 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-31 17:22:45,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:45,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:45,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:45,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:46,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:46,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:46,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:46,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:46,633 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-31 17:22:46,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:46,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:46,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 17:22:46,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:46,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:46,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:50,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:50,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-31 17:22:50,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:50,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-31 17:22:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-31 17:22:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 17:22:50,305 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-31 17:22:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:50,374 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-31 17:22:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 17:22:50,374 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-31 17:22:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:50,375 INFO L225 Difference]: With dead ends: 60 [2019-01-31 17:22:50,375 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:22:50,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 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-31 17:22:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:22:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-31 17:22:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:22:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-31 17:22:50,379 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-31 17:22:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:50,379 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-31 17:22:50,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-31 17:22:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-31 17:22:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-31 17:22:50,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:50,380 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-31 17:22:50,380 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-31 17:22:50,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:50,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:50,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:51,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:51,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:51,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:51,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:51,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:51,617 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-31 17:22:51,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:51,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:51,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:51,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:51,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:51,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:54,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:54,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-31 17:22:54,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:54,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-31 17:22:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-31 17:22:54,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 17:22:54,893 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-31 17:22:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:54,990 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-31 17:22:54,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 17:22:54,991 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-31 17:22:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:54,991 INFO L225 Difference]: With dead ends: 61 [2019-01-31 17:22:54,992 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 17:22:54,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 17:22:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 17:22:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 17:22:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:22:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-31 17:22:54,995 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-31 17:22:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:54,995 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-31 17:22:54,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-31 17:22:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-31 17:22:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 17:22:54,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:54,996 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-31 17:22:54,996 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:54,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:54,996 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-31 17:22:54,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:54,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:54,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:54,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:54,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:56,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:56,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:56,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:56,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:56,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:56,497 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-31 17:22:56,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:56,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:56,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:56,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:00,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:00,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-31 17:23:00,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:00,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 17:23:00,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 17:23:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 17:23:00,078 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-31 17:23:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:00,196 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-31 17:23:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 17:23:00,196 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-31 17:23:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:00,197 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:23:00,197 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:23:00,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 17:23:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:23:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-31 17:23:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 17:23:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-31 17:23:00,200 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-31 17:23:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:00,200 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-31 17:23:00,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 17:23:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-31 17:23:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-31 17:23:00,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:00,201 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-31 17:23:00,201 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:00,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-31 17:23:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:00,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:02,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:02,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:02,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:02,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:02,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:02,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:23:02,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:02,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:02,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-31 17:23:02,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:02,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:02,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:06,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:06,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-31 17:23:06,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:06,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 17:23:06,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 17:23:06,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 17:23:06,082 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-31 17:23:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:06,161 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-31 17:23:06,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 17:23:06,162 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-31 17:23:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:06,162 INFO L225 Difference]: With dead ends: 63 [2019-01-31 17:23:06,163 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:23:06,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 17:23:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:23:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 17:23:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:23:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-31 17:23:06,166 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-31 17:23:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:06,166 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-31 17:23:06,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 17:23:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-31 17:23:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 17:23:06,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:06,167 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-31 17:23:06,167 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-31 17:23:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:06,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:06,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:07,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:07,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:07,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:07,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:07,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:07,582 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-31 17:23:07,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:07,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:07,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:07,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:07,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:07,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:11,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-31 17:23:11,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:11,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-31 17:23:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-31 17:23:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:23:11,466 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-31 17:23:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:11,570 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-31 17:23:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 17:23:11,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-31 17:23:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:11,572 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:23:11,572 INFO L226 Difference]: Without dead ends: 62 [2019-01-31 17:23:11,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:23:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-31 17:23:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-31 17:23:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 17:23:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-31 17:23:11,576 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-31 17:23:11,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:11,576 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-31 17:23:11,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-31 17:23:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-31 17:23:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-31 17:23:11,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:11,577 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-31 17:23:11,577 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-31 17:23:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:11,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:11,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:11,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:11,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:12,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:12,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:12,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:12,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:12,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:12,919 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-31 17:23:12,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:12,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:12,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:13,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:16,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:16,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-31 17:23:16,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:16,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-31 17:23:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-31 17:23:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 17:23:16,832 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-31 17:23:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:16,925 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-31 17:23:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 17:23:16,926 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-31 17:23:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:16,926 INFO L225 Difference]: With dead ends: 65 [2019-01-31 17:23:16,927 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 17:23:16,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 17:23:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 17:23:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 17:23:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 17:23:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-31 17:23:16,930 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-31 17:23:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:16,930 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-31 17:23:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-31 17:23:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-31 17:23:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 17:23:16,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:16,930 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-31 17:23:16,931 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-31 17:23:16,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:16,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:16,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:16,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:18,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:18,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:18,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:18,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:18,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:18,808 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-31 17:23:18,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:18,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:19,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-31 17:23:19,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:19,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:19,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:22,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:22,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-31 17:23:22,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:22,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-31 17:23:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-31 17:23:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 17:23:22,835 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-31 17:23:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:22,915 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-31 17:23:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 17:23:22,915 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-31 17:23:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:22,916 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:23:22,916 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 17:23:22,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 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-31 17:23:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 17:23:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-31 17:23:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 17:23:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-31 17:23:22,920 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-31 17:23:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:22,920 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-31 17:23:22,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-31 17:23:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-31 17:23:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-31 17:23:22,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:22,920 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-31 17:23:22,921 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-31 17:23:22,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:22,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:22,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:22,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:24,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:24,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:24,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:24,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:24,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:24,760 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-31 17:23:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:24,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:24,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:24,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:24,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:24,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:28,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:28,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-31 17:23:28,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:28,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-31 17:23:28,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-31 17:23:28,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 17:23:28,895 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-31 17:23:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:29,026 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-31 17:23:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 17:23:29,027 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-31 17:23:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:29,028 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:23:29,028 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:23:29,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 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-31 17:23:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:23:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 17:23:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 17:23:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-31 17:23:29,030 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-31 17:23:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:29,030 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-31 17:23:29,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-31 17:23:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-31 17:23:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 17:23:29,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:29,031 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-31 17:23:29,031 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-31 17:23:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:29,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:29,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:29,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:30,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:30,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:30,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:30,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:30,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:30,406 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-31 17:23:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:30,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:30,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:30,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:34,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-31 17:23:34,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:34,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 17:23:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 17:23:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 17:23:34,797 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-31 17:23:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:34,933 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-31 17:23:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 17:23:34,934 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-31 17:23:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:34,934 INFO L225 Difference]: With dead ends: 68 [2019-01-31 17:23:34,934 INFO L226 Difference]: Without dead ends: 66 [2019-01-31 17:23:34,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 17:23:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-31 17:23:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-31 17:23:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:23:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-31 17:23:34,937 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-31 17:23:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:34,937 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-31 17:23:34,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 17:23:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-31 17:23:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-31 17:23:34,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:34,937 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-31 17:23:34,937 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-31 17:23:34,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:34,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:34,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:34,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:36,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:36,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:36,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:36,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:36,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:36,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 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-31 17:23:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:36,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:36,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-31 17:23:36,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:36,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:36,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:40,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:40,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-31 17:23:40,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:40,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 17:23:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 17:23:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 17:23:40,997 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-31 17:23:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:41,113 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-31 17:23:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 17:23:41,113 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-31 17:23:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:41,114 INFO L225 Difference]: With dead ends: 69 [2019-01-31 17:23:41,114 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:23:41,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 17:23:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:23:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 17:23:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 17:23:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-31 17:23:41,117 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-31 17:23:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:41,117 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-31 17:23:41,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 17:23:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-31 17:23:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 17:23:41,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:41,118 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-31 17:23:41,118 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-31 17:23:41,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:41,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:41,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:41,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:41,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:42,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:42,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:42,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:42,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:42,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:42,623 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-31 17:23:42,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:42,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:42,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:42,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:42,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:42,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:47,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-31 17:23:47,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:47,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-31 17:23:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-31 17:23:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:23:47,247 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-31 17:23:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:47,374 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-31 17:23:47,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 17:23:47,377 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-31 17:23:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:47,378 INFO L225 Difference]: With dead ends: 70 [2019-01-31 17:23:47,378 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:23:47,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:23:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:23:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-31 17:23:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 17:23:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-31 17:23:47,385 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-31 17:23:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:47,385 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-31 17:23:47,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-31 17:23:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-31 17:23:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-31 17:23:47,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:47,386 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-31 17:23:47,386 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:47,386 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-31 17:23:47,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:47,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:47,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:49,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:49,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:49,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:49,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:49,114 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-31 17:23:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:49,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:49,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:49,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:53,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:53,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-31 17:23:53,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:53,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-31 17:23:53,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-31 17:23:53,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 17:23:53,509 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-31 17:23:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:53,598 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-31 17:23:53,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 17:23:53,598 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-31 17:23:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:53,599 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:23:53,599 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:23:53,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 17:23:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:23:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 17:23:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 17:23:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-31 17:23:53,603 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-31 17:23:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:53,603 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-31 17:23:53,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-31 17:23:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-31 17:23:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 17:23:53,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:53,604 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-31 17:23:53,604 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:53,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-31 17:23:53,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:53,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:53,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:55,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:55,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:55,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:55,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:55,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:55,504 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-31 17:23:55,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:55,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:55,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-31 17:23:55,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:55,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:55,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:00,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-31 17:24:00,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:00,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-31 17:24:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-31 17:24:00,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 17:24:00,806 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-31 17:24:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:00,908 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-31 17:24:00,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 17:24:00,909 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-31 17:24:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:00,910 INFO L225 Difference]: With dead ends: 72 [2019-01-31 17:24:00,910 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 17:24:00,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 17:24:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 17:24:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-31 17:24:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-31 17:24:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-31 17:24:00,913 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-31 17:24:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:00,913 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-31 17:24:00,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-31 17:24:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-31 17:24:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-31 17:24:00,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:00,914 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-31 17:24:00,914 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-31 17:24:00,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:00,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:00,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:03,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:03,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:03,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:03,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:03,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:03,126 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-31 17:24:03,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:03,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:03,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:03,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:03,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:03,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:09,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-31 17:24:09,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:09,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-31 17:24:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-31 17:24:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:24:09,190 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-31 17:24:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:09,555 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-31 17:24:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 17:24:09,555 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-31 17:24:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:09,556 INFO L225 Difference]: With dead ends: 73 [2019-01-31 17:24:09,556 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:24:09,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 17:24:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:24:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 17:24:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:24:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-31 17:24:09,558 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-31 17:24:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:09,559 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-31 17:24:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-31 17:24:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-31 17:24:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 17:24:09,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:09,559 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-31 17:24:09,559 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-31 17:24:09,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:09,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:09,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:09,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:09,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:11,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:11,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:11,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:11,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:11,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:11,274 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-31 17:24:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:11,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:11,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:11,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:16,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:16,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-31 17:24:16,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:16,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 17:24:16,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 17:24:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 17:24:16,662 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-31 17:24:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:16,761 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-31 17:24:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 17:24:16,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-31 17:24:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:16,762 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:24:16,763 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 17:24:16,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 17:24:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 17:24:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-31 17:24:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 17:24:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-31 17:24:16,766 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-31 17:24:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:16,767 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-31 17:24:16,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 17:24:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-31 17:24:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-31 17:24:16,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:16,767 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-31 17:24:16,768 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-31 17:24:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:16,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:18,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:18,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:18,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:18,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:18,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:18,496 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-31 17:24:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:18,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:19,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-31 17:24:19,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:19,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:19,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:24,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:24,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-31 17:24:24,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:24,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 17:24:24,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 17:24:24,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 17:24:24,251 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-31 17:24:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:24,466 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-31 17:24:24,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 17:24:24,467 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-31 17:24:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:24,467 INFO L225 Difference]: With dead ends: 75 [2019-01-31 17:24:24,467 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 17:24:24,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 17:24:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 17:24:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 17:24:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:24:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-31 17:24:24,470 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-31 17:24:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:24,470 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-31 17:24:24,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 17:24:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-31 17:24:24,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 17:24:24,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:24,471 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-31 17:24:24,471 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:24,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:24,471 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-31 17:24:24,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:24,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:24,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:24,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:24,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:26,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:26,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:26,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:26,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:26,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:26,453 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-31 17:24:26,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:26,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:26,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:26,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:26,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:26,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:31,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:31,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-31 17:24:31,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:31,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-31 17:24:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-31 17:24:31,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:24:31,843 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-31 17:24:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:32,008 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-31 17:24:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 17:24:32,009 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-31 17:24:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:32,010 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:24:32,010 INFO L226 Difference]: Without dead ends: 74 [2019-01-31 17:24:32,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:24:32,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-31 17:24:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-31 17:24:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:24:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-31 17:24:32,013 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-31 17:24:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:32,014 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-31 17:24:32,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-31 17:24:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-31 17:24:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-31 17:24:32,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:32,015 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-31 17:24:32,015 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-31 17:24:32,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:32,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:32,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:32,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:32,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:33,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:33,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:33,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:33,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:33,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:33,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 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-31 17:24:33,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:33,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:33,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:33,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:39,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:39,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-31 17:24:39,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:39,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-31 17:24:39,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-31 17:24:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 17:24:39,206 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-31 17:24:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:39,377 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-31 17:24:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 17:24:39,377 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-31 17:24:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:39,378 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:24:39,378 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:24:39,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 17:24:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:24:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 17:24:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:24:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-31 17:24:39,383 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-31 17:24:39,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:39,383 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-31 17:24:39,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-31 17:24:39,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-31 17:24:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 17:24:39,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:39,384 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-31 17:24:39,384 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:39,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:39,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-31 17:24:39,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:39,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:41,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:41,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:41,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:41,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:41,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:41,840 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-31 17:24:41,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:41,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:42,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-31 17:24:42,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:42,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:42,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:48,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-31 17:24:48,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:48,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 17:24:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 17:24:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 17:24:48,191 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-31 17:24:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:48,341 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-31 17:24:48,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 17:24:48,342 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-31 17:24:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:48,343 INFO L225 Difference]: With dead ends: 78 [2019-01-31 17:24:48,343 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:24:48,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 17:24:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:24:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-31 17:24:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 17:24:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-31 17:24:48,347 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-31 17:24:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:48,347 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-31 17:24:48,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 17:24:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-31 17:24:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-31 17:24:48,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:48,348 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-31 17:24:48,348 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-31 17:24:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:48,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:48,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:50,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:50,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:50,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:50,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:50,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:50,474 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-31 17:24:50,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:50,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:50,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:50,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:50,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:50,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:56,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:56,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-31 17:24:56,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:56,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-31 17:24:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-31 17:24:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:24:56,640 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-31 17:24:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:56,784 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-31 17:24:56,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 17:24:56,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-31 17:24:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:56,785 INFO L225 Difference]: With dead ends: 79 [2019-01-31 17:24:56,785 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:24:56,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 17:24:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:24:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 17:24:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:24:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-31 17:24:56,788 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-31 17:24:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:56,788 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-31 17:24:56,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-31 17:24:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-31 17:24:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 17:24:56,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:56,789 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-31 17:24:56,789 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-31 17:24:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:56,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:56,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:58,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:58,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:58,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:58,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:58,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:58,761 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-31 17:24:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:58,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:58,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:58,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:04,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:04,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-31 17:25:04,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:04,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 17:25:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 17:25:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 17:25:04,815 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-31 17:25:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:04,974 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-31 17:25:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 17:25:04,975 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-31 17:25:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:04,975 INFO L225 Difference]: With dead ends: 80 [2019-01-31 17:25:04,975 INFO L226 Difference]: Without dead ends: 78 [2019-01-31 17:25:04,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 17:25:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-31 17:25:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-31 17:25:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:25:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-31 17:25:04,978 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-31 17:25:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:04,978 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-31 17:25:04,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 17:25:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-31 17:25:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-31 17:25:04,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:04,979 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-31 17:25:04,979 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:04,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-31 17:25:04,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:04,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:04,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:07,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:07,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:07,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:07,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:07,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:07,291 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-31 17:25:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:07,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:08,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-31 17:25:08,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:08,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:08,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:14,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:14,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-31 17:25:14,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:14,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 17:25:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 17:25:14,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 17:25:14,045 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-31 17:25:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:14,153 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-31 17:25:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 17:25:14,153 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-31 17:25:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:14,154 INFO L225 Difference]: With dead ends: 81 [2019-01-31 17:25:14,154 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 17:25:14,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 17:25:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 17:25:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 17:25:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 17:25:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-31 17:25:14,157 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-31 17:25:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:14,157 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-31 17:25:14,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 17:25:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-31 17:25:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 17:25:14,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:14,158 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-31 17:25:14,158 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-31 17:25:14,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:14,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:14,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:14,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:16,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:16,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:16,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:16,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:16,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:16,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 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-31 17:25:16,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:16,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:16,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:16,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:16,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:16,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:22,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:22,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-31 17:25:22,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:22,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-31 17:25:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-31 17:25:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:25:22,909 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-31 17:25:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:23,027 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-31 17:25:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-31 17:25:23,027 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-31 17:25:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:23,027 INFO L225 Difference]: With dead ends: 82 [2019-01-31 17:25:23,028 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:25:23,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 17:25:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:25:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-31 17:25:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 17:25:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-31 17:25:23,031 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-31 17:25:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:23,031 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-31 17:25:23,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-31 17:25:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-31 17:25:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-31 17:25:23,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:23,032 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-31 17:25:23,032 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-31 17:25:23,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:23,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:23,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:23,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:23,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:25,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:25,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:25,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:25,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:25,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:25,148 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-31 17:25:25,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:25,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:25,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:25,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:31,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:31,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-31 17:25:31,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:31,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-31 17:25:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-31 17:25:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 17:25:31,791 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-31 17:25:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:32,160 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-31 17:25:32,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 17:25:32,161 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-31 17:25:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:32,161 INFO L225 Difference]: With dead ends: 83 [2019-01-31 17:25:32,161 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 17:25:32,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 17:25:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 17:25:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 17:25:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 17:25:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-31 17:25:32,165 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-31 17:25:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:32,165 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-31 17:25:32,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-31 17:25:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-31 17:25:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 17:25:32,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:32,166 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-31 17:25:32,166 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-31 17:25:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:32,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:34,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:34,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:34,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:34,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:34,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:34,500 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-31 17:25:34,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:34,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:35,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-31 17:25:35,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:35,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:35,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:42,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:42,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-31 17:25:42,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:42,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 17:25:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 17:25:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 17:25:42,016 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-31 17:25:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:42,649 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-31 17:25:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 17:25:42,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-31 17:25:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:42,650 INFO L225 Difference]: With dead ends: 84 [2019-01-31 17:25:42,651 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 17:25:42,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 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-31 17:25:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 17:25:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-31 17:25:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-31 17:25:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-31 17:25:42,654 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-31 17:25:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:42,654 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-31 17:25:42,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 17:25:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-31 17:25:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-31 17:25:42,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:42,655 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-31 17:25:42,656 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:42,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-31 17:25:42,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:42,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:42,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:42,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:42,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:45,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:45,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:45,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:45,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:45,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:45,008 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-31 17:25:45,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:45,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:45,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:45,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:45,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:45,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-31 17:25:52,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:52,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-31 17:25:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-31 17:25:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:25:52,108 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-31 17:25:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:52,257 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-31 17:25:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 17:25:52,257 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-31 17:25:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:52,258 INFO L225 Difference]: With dead ends: 85 [2019-01-31 17:25:52,258 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:25:52,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 17:25:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:25:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 17:25:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 17:25:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-31 17:25:52,262 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-31 17:25:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:52,262 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-31 17:25:52,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-31 17:25:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-31 17:25:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 17:25:52,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:52,263 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-31 17:25:52,264 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-31 17:25:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:52,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:52,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:52,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:54,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:54,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:54,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:54,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:54,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:54,723 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-31 17:25:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:54,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:54,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:54,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:01,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:01,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-31 17:26:01,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:01,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 17:26:01,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 17:26:01,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 17:26:01,572 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-31 17:26:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:01,688 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-31 17:26:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-31 17:26:01,688 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-31 17:26:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:01,689 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:26:01,689 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 17:26:01,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 17:26:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 17:26:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-31 17:26:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:26:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-31 17:26:01,693 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-31 17:26:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:01,693 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-31 17:26:01,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 17:26:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-31 17:26:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-31 17:26:01,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:01,694 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-31 17:26:01,694 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-31 17:26:01,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:01,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:01,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:04,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:04,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:04,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:04,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:04,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:04,324 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-31 17:26:04,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:26:04,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:26:05,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-31 17:26:05,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:05,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:05,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:12,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-31 17:26:12,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:12,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 17:26:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 17:26:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 17:26:12,500 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-31 17:26:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:12,681 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-31 17:26:12,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 17:26:12,682 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-31 17:26:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:12,682 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:26:12,682 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:26:12,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 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-31 17:26:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:26:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 17:26:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 17:26:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-31 17:26:12,685 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-31 17:26:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:12,685 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-31 17:26:12,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 17:26:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-31 17:26:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 17:26:12,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:12,686 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-31 17:26:12,686 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-31 17:26:12,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:12,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:12,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:12,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:12,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:15,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:15,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:15,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:15,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:15,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:15,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:26:15,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:26:15,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:26:15,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:26:15,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:15,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:15,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:22,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:22,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-31 17:26:22,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:22,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-31 17:26:22,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-31 17:26:22,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:26:22,296 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-31 17:26:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:22,498 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-31 17:26:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-31 17:26:22,498 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-31 17:26:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:22,498 INFO L225 Difference]: With dead ends: 88 [2019-01-31 17:26:22,499 INFO L226 Difference]: Without dead ends: 86 [2019-01-31 17:26:22,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:26:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-31 17:26:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-31 17:26:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-31 17:26:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-31 17:26:22,501 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-31 17:26:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:22,501 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-31 17:26:22,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-31 17:26:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-31 17:26:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-31 17:26:22,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:22,502 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-31 17:26:22,502 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-31 17:26:22,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:22,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:22,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:22,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:22,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:25,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:25,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:25,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:25,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:25,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:25,081 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-31 17:26:25,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:25,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:26:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:25,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:25,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:32,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:32,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-31 17:26:32,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:32,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-31 17:26:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-31 17:26:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 17:26:32,436 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-31 17:26:32,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:32,721 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-31 17:26:32,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 17:26:32,721 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-31 17:26:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:32,722 INFO L225 Difference]: With dead ends: 89 [2019-01-31 17:26:32,722 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:26:32,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 17:26:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:26:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 17:26:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 17:26:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-31 17:26:32,725 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-31 17:26:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:32,725 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-31 17:26:32,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-31 17:26:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-31 17:26:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 17:26:32,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:32,726 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-31 17:26:32,726 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-31 17:26:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:32,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:32,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:35,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:35,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:35,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:35,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:35,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:35,310 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-31 17:26:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:26:35,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:26:36,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-31 17:26:36,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:36,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:36,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:44,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-31 17:26:44,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:44,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 17:26:44,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 17:26:44,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 17:26:44,032 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-31 17:26:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:44,179 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-31 17:26:44,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 17:26:44,180 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-31 17:26:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:44,180 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:26:44,180 INFO L226 Difference]: Without dead ends: 88 [2019-01-31 17:26:44,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 17:26:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-31 17:26:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-31 17:26:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-31 17:26:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-31 17:26:44,183 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-31 17:26:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:44,184 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-31 17:26:44,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 17:26:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-31 17:26:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-31 17:26:44,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:44,185 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-31 17:26:44,185 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:44,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:44,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-31 17:26:44,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:44,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:44,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:46,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:46,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:46,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:46,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:46,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:46,676 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-31 17:26:46,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:26:46,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:26:46,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:26:46,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:46,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:46,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:54,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-31 17:26:54,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-31 17:26:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-31 17:26:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:26:54,609 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-31 17:26:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:54,773 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-31 17:26:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:26:54,773 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-31 17:26:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:54,774 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:26:54,774 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:26:54,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:26:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:26:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 17:26:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 17:26:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-31 17:26:54,777 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-31 17:26:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:54,778 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-31 17:26:54,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-31 17:26:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-31 17:26:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 17:26:54,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:54,779 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-31 17:26:54,779 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-31 17:26:54,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:54,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:54,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:57,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:57,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:57,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:57,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:57,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:57,408 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-31 17:26:57,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:57,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:26:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:57,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:57,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:05,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:05,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-31 17:27:05,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:05,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 17:27:05,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 17:27:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:27:05,531 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-31 17:27:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:05,839 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-31 17:27:05,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-31 17:27:05,839 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-31 17:27:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:05,840 INFO L225 Difference]: With dead ends: 92 [2019-01-31 17:27:05,840 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:27:05,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:27:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:27:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-31 17:27:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-31 17:27:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-31 17:27:05,843 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-31 17:27:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:05,843 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-31 17:27:05,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 17:27:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-31 17:27:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-31 17:27:05,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:05,844 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-31 17:27:05,844 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:05,844 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-31 17:27:05,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:05,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:05,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:05,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:05,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:08,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:08,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:08,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:08,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:08,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:08,439 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-31 17:27:08,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:27:08,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:27:09,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-31 17:27:09,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:09,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:09,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:17,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:17,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-31 17:27:17,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:17,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:27:17,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:27:17,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:27:17,591 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-31 17:27:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:17,820 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-31 17:27:17,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:27:17,820 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-31 17:27:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:17,821 INFO L225 Difference]: With dead ends: 93 [2019-01-31 17:27:17,821 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:27:17,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:27:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:27:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 17:27:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:27:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-31 17:27:17,824 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-31 17:27:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:17,824 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-31 17:27:17,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:27:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-31 17:27:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 17:27:17,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:17,825 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-31 17:27:17,825 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:17,825 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-31 17:27:17,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:17,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:17,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:17,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:17,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:21,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:21,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:21,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:21,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:21,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:21,059 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-31 17:27:21,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:27:21,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:27:21,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:27:21,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:21,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:21,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:29,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:29,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-31 17:27:29,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:29,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-31 17:27:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-31 17:27:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:27:29,567 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-31 17:27:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:29,699 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-31 17:27:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-31 17:27:29,699 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-31 17:27:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:29,700 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:27:29,700 INFO L226 Difference]: Without dead ends: 92 [2019-01-31 17:27:29,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:27:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-31 17:27:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-31 17:27:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-31 17:27:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-31 17:27:29,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-31 17:27:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:29,703 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-31 17:27:29,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-31 17:27:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-31 17:27:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-31 17:27:29,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:29,703 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-31 17:27:29,704 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-31 17:27:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:29,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:29,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:29,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:29,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:32,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:32,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:32,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:32,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:32,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:32,396 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-31 17:27:32,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:32,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:27:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:32,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:32,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:40,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:40,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-31 17:27:40,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:40,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-31 17:27:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-31 17:27:40,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:27:40,997 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-31 17:27:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:41,218 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-31 17:27:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-31 17:27:41,218 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-31 17:27:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:41,219 INFO L225 Difference]: With dead ends: 95 [2019-01-31 17:27:41,219 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:27:41,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:27:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:27:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 17:27:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:27:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-31 17:27:41,222 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-31 17:27:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:41,222 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-31 17:27:41,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-31 17:27:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-31 17:27:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 17:27:41,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:41,223 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-31 17:27:41,223 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-31 17:27:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:41,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:44,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:44,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:44,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:44,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:44,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:44,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:27:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:27:44,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:27:45,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-31 17:27:45,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:45,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:45,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:53,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:53,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-31 17:27:53,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:53,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 17:27:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 17:27:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:27:53,783 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-31 17:27:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:53,919 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-31 17:27:53,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-31 17:27:53,920 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-31 17:27:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:53,921 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:27:53,921 INFO L226 Difference]: Without dead ends: 94 [2019-01-31 17:27:53,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:27:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-31 17:27:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-31 17:27:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-31 17:27:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-31 17:27:53,925 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-31 17:27:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:53,925 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-31 17:27:53,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 17:27:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-31 17:27:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-31 17:27:53,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:53,926 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-31 17:27:53,926 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:53,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:53,926 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-31 17:27:53,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:53,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:53,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:53,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:57,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:57,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:57,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:57,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:57,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:57,122 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-31 17:27:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:27:57,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:27:57,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:27:57,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:57,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:57,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:06,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:06,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-31 17:28:06,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:06,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-31 17:28:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-31 17:28:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:28:06,368 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-31 17:28:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:06,627 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-31 17:28:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-31 17:28:06,628 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-31 17:28:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:06,628 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:28:06,629 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:28:06,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:28:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:28:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 17:28:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:28:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-31 17:28:06,632 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-31 17:28:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:06,632 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-31 17:28:06,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-31 17:28:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-31 17:28:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 17:28:06,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:06,633 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-31 17:28:06,633 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-31 17:28:06,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:06,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:06,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:09,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:09,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:09,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:09,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:09,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:09,682 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-31 17:28:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:09,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:28:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:09,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:09,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:18,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:18,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-31 17:28:18,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:18,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 17:28:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 17:28:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:28:18,884 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-31 17:28:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:19,081 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-31 17:28:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-31 17:28:19,081 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-31 17:28:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:19,082 INFO L225 Difference]: With dead ends: 98 [2019-01-31 17:28:19,082 INFO L226 Difference]: Without dead ends: 96 [2019-01-31 17:28:19,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:28:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-31 17:28:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-31 17:28:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:28:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-31 17:28:19,085 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-31 17:28:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:19,085 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-31 17:28:19,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 17:28:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-31 17:28:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-31 17:28:19,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:19,085 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-31 17:28:19,086 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-31 17:28:19,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:19,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:19,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:22,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:22,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:22,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:22,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:22,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:22,297 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-31 17:28:22,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:28:22,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:28:23,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-31 17:28:23,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:23,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:23,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:33,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:33,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-31 17:28:33,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:33,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:28:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:28:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:28:33,158 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-31 17:28:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:33,306 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-31 17:28:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-31 17:28:33,306 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-31 17:28:33,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:33,307 INFO L225 Difference]: With dead ends: 99 [2019-01-31 17:28:33,307 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:28:33,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:28:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:28:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 17:28:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:28:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-31 17:28:33,310 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-31 17:28:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:33,310 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-31 17:28:33,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:28:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-31 17:28:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 17:28:33,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:33,311 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-31 17:28:33,311 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-31 17:28:33,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:33,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:33,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:36,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:36,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:36,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:36,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:36,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:36,622 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-31 17:28:36,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:28:36,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:28:36,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:28:36,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:36,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:36,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:46,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-31 17:28:46,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:46,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-31 17:28:46,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-31 17:28:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:28:46,291 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-31 17:28:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:46,447 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-31 17:28:46,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-31 17:28:46,448 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-31 17:28:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:46,448 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:28:46,449 INFO L226 Difference]: Without dead ends: 98 [2019-01-31 17:28:46,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:28:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-31 17:28:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-31 17:28:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:28:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-31 17:28:46,453 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-31 17:28:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:46,453 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-31 17:28:46,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-31 17:28:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-31 17:28:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-31 17:28:46,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:46,454 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-31 17:28:46,454 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-31 17:28:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:46,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:46,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:49,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:49,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:49,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:49,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:49,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:49,626 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-31 17:28:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:49,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:28:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:49,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:49,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:59,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:59,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-31 17:28:59,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:59,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-31 17:28:59,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-31 17:28:59,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:28:59,324 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-31 17:28:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:59,480 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-31 17:28:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-31 17:28:59,480 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-31 17:28:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:59,481 INFO L225 Difference]: With dead ends: 101 [2019-01-31 17:28:59,481 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:28:59,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:28:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:28:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 17:28:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 17:28:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-31 17:28:59,486 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-31 17:28:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:59,486 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-31 17:28:59,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-31 17:28:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-31 17:28:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 17:28:59,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:59,487 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-31 17:28:59,487 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-31 17:28:59,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:59,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:59,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:59,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:59,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:02,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:02,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:02,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:02,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:02,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:02,957 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-31 17:29:02,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:29:02,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:29:04,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-31 17:29:04,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:04,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:04,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:14,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:14,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-31 17:29:14,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:14,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-31 17:29:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-31 17:29:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:29:14,545 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-31 17:29:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:14,707 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-31 17:29:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-31 17:29:14,708 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-31 17:29:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:14,708 INFO L225 Difference]: With dead ends: 102 [2019-01-31 17:29:14,708 INFO L226 Difference]: Without dead ends: 100 [2019-01-31 17:29:14,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:29:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-31 17:29:14,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-31 17:29:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:29:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-31 17:29:14,712 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-31 17:29:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:14,712 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-31 17:29:14,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-31 17:29:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-31 17:29:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-31 17:29:14,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:14,713 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-31 17:29:14,713 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-31 17:29:14,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:14,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:14,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:14,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:14,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:18,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:18,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:18,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:18,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:18,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:18,199 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-31 17:29:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:29:18,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:29:18,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:29:18,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:18,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:18,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:28,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:28,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-31 17:29:28,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:28,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-31 17:29:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-31 17:29:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:29:28,323 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-31 17:29:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:28,554 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-31 17:29:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-31 17:29:28,554 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-31 17:29:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:28,555 INFO L225 Difference]: With dead ends: 103 [2019-01-31 17:29:28,555 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:29:28,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:29:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:29:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 17:29:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:29:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-31 17:29:28,559 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-31 17:29:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:28,559 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-31 17:29:28,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-31 17:29:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-31 17:29:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:29:28,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:28,560 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-31 17:29:28,560 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-31 17:29:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:28,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:28,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:28,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:32,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:32,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:32,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:32,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:32,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:32,323 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-31 17:29:32,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:32,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:29:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:32,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:32,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:42,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:42,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-31 17:29:42,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:42,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 17:29:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 17:29:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:29:42,727 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-31 17:29:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:43,017 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-31 17:29:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-31 17:29:43,018 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-31 17:29:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:43,018 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:29:43,018 INFO L226 Difference]: Without dead ends: 102 [2019-01-31 17:29:43,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:29:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-31 17:29:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-31 17:29:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:29:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-31 17:29:43,022 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-31 17:29:43,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:43,022 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-31 17:29:43,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 17:29:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-31 17:29:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-31 17:29:43,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:43,023 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-31 17:29:43,023 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-31 17:29:43,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:43,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:43,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:46,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:46,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:46,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:46,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:46,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:46,380 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-31 17:29:46,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:29:46,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:29:48,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-31 17:29:48,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:48,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:48,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:58,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-31 17:29:58,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:29:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:29:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:29:58,668 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-31 17:29:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:58,914 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-31 17:29:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-31 17:29:58,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-31 17:29:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:58,915 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:29:58,915 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:29:58,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:29:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:29:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 17:29:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:29:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-31 17:29:58,919 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-31 17:29:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:58,919 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-31 17:29:58,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:29:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-31 17:29:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 17:29:58,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:58,919 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-31 17:29:58,920 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-31 17:29:58,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:58,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:58,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:58,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:02,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:02,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:02,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:02,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:02,423 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-31 17:30:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:30:02,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:30:02,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:30:02,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:02,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:02,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:13,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:13,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-31 17:30:13,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:13,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-31 17:30:13,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-31 17:30:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:30:13,327 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-31 17:30:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:13,583 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-31 17:30:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-31 17:30:13,584 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-31 17:30:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:13,584 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:30:13,584 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 17:30:13,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:30:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 17:30:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-31 17:30:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:30:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-31 17:30:13,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-31 17:30:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:13,589 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-31 17:30:13,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-31 17:30:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-31 17:30:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-31 17:30:13,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:13,590 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-31 17:30:13,590 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-31 17:30:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:13,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:30:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:13,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:17,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:17,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:17,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:17,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:17,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:17,126 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-31 17:30:17,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:30:17,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:30:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:17,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:17,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:28,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:28,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-31 17:30:28,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:28,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-31 17:30:28,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-31 17:30:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:30:28,474 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-31 17:30:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:28,658 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-31 17:30:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-31 17:30:28,659 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-31 17:30:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:28,660 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:30:28,660 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:30:28,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:30:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:30:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 17:30:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:30:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-31 17:30:28,665 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-31 17:30:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:28,666 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-31 17:30:28,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-31 17:30:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-31 17:30:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:30:28,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:28,667 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-31 17:30:28,667 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:28,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-31 17:30:28,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:30:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:28,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:32,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:32,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:32,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:32,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:32,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:32,341 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-31 17:30:32,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:30:32,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:30:34,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-31 17:30:34,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:34,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:34,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-31 17:30:45,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:45,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-31 17:30:45,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-31 17:30:45,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:30:45,616 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-31 17:30:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:45,956 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-31 17:30:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-31 17:30:45,956 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-31 17:30:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:45,957 INFO L225 Difference]: With dead ends: 108 [2019-01-31 17:30:45,957 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:30:45,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:30:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:30:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-31 17:30:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 17:30:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-31 17:30:45,962 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-31 17:30:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:45,962 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-31 17:30:45,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-31 17:30:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-31 17:30:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-31 17:30:45,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:45,963 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-31 17:30:45,964 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-31 17:30:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:45,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:45,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:30:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:45,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:49,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:49,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:49,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:49,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:49,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:49,992 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-31 17:30:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:30:50,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:30:50,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:30:50,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:50,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:50,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:01,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-31 17:31:01,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:01,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-31 17:31:01,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-31 17:31:01,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:31:01,211 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-31 17:31:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:01,502 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-31 17:31:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-31 17:31:01,503 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-31 17:31:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:01,503 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:31:01,503 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:31:01,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:31:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:31:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 17:31:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:31:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-31 17:31:01,507 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-31 17:31:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:01,508 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-31 17:31:01,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-31 17:31:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-31 17:31:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 17:31:01,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:01,508 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-31 17:31:01,509 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:01,509 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-31 17:31:01,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:01,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:01,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:01,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:01,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:05,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:05,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:05,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:05,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:05,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:05,569 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:31:05,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:05,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:31:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:05,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:05,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:17,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:17,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-31 17:31:17,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:17,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 17:31:17,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 17:31:17,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:31:17,177 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-31 17:31:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:17,447 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-31 17:31:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-31 17:31:17,454 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-31 17:31:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:17,454 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:31:17,455 INFO L226 Difference]: Without dead ends: 108 [2019-01-31 17:31:17,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:31:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-31 17:31:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-31 17:31:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:31:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-31 17:31:17,459 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-31 17:31:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:17,459 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-31 17:31:17,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 17:31:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-31 17:31:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-31 17:31:17,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:17,460 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-31 17:31:17,460 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:17,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:17,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-31 17:31:17,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:17,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:17,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:21,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:21,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:21,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:21,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:21,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:21,551 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:31:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:31:21,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:31:23,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-31 17:31:23,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:31:23,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:23,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-31 17:31:35,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:35,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:31:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:31:35,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:31:35,808 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-31 17:31:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:36,037 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-31 17:31:36,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-31 17:31:36,037 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-31 17:31:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:36,038 INFO L225 Difference]: With dead ends: 111 [2019-01-31 17:31:36,038 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:31:36,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:31:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:31:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 17:31:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 17:31:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-31 17:31:36,042 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-31 17:31:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:36,042 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-31 17:31:36,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:31:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-31 17:31:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 17:31:36,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:36,042 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-31 17:31:36,043 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-31 17:31:36,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:36,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:36,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:40,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:40,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:40,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:40,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:40,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:40,208 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:31:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:31:40,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:31:40,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:31:40,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:31:40,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:40,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:52,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-31 17:31:52,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:52,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-31 17:31:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-31 17:31:52,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:31:52,146 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-31 17:31:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:52,383 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-31 17:31:52,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-31 17:31:52,384 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-31 17:31:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:52,384 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:31:52,384 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:31:52,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:31:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:31:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-31 17:31:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-31 17:31:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-31 17:31:52,388 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-31 17:31:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:52,388 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-31 17:31:52,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-31 17:31:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-31 17:31:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-31 17:31:52,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:52,389 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-31 17:31:52,389 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:52,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:52,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-31 17:31:52,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:52,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:52,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:56,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:56,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:56,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:56,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:56,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:56,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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:31:56,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:56,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:31:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:56,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:56,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:08,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:08,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-31 17:32:08,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:08,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-31 17:32:08,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-31 17:32:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 17:32:08,852 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-31 17:32:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:09,126 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-31 17:32:09,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-31 17:32:09,127 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-31 17:32:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:09,127 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:32:09,127 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:32:09,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 17:32:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:32:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 17:32:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:32:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-31 17:32:09,131 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-31 17:32:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:09,131 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-31 17:32:09,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-31 17:32:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-31 17:32:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 17:32:09,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:09,132 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-31 17:32:09,132 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-31 17:32:09,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:09,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:09,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:32:09,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:09,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:13,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:13,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:13,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:13,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:13,440 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:32:13,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:32:13,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:32:16,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-31 17:32:16,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:32:16,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:16,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:28,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:28,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-31 17:32:28,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:28,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-31 17:32:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-31 17:32:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 17:32:28,692 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-31 17:32:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:29,040 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-31 17:32:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-31 17:32:29,041 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-31 17:32:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:29,041 INFO L225 Difference]: With dead ends: 114 [2019-01-31 17:32:29,041 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:32:29,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 17:32:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:32:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-31 17:32:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 17:32:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-31 17:32:29,045 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-31 17:32:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:29,045 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-31 17:32:29,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-31 17:32:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-31 17:32:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 17:32:29,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:29,046 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-31 17:32:29,046 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-31 17:32:29,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:29,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:29,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:29,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:33,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:33,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:33,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:33,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:33,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:33,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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:32:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:32:33,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:32:33,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:32:33,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:32:33,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:33,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:46,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:46,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-31 17:32:46,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:46,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-31 17:32:46,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-31 17:32:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 17:32:46,104 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-31 17:32:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:46,360 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-31 17:32:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-31 17:32:46,360 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-31 17:32:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:46,361 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:32:46,361 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:32:46,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 17:32:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:32:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-31 17:32:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:32:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-31 17:32:46,366 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-31 17:32:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:46,366 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-31 17:32:46,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-31 17:32:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-31 17:32:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-31 17:32:46,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:46,367 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-31 17:32:46,367 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:46,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-31 17:32:46,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:46,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:46,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:46,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:50,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:50,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:50,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:50,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:50,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:50,758 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:32:50,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:32:50,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:32:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:50,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:50,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:03,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:03,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-31 17:33:03,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:03,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-31 17:33:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-31 17:33:03,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:33:03,907 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-31 17:33:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:04,133 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-31 17:33:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-31 17:33:04,133 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-31 17:33:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:04,134 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:33:04,134 INFO L226 Difference]: Without dead ends: 114 [2019-01-31 17:33:04,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:33:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-31 17:33:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-31 17:33:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-31 17:33:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-31 17:33:04,138 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-31 17:33:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:04,139 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-31 17:33:04,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-31 17:33:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-31 17:33:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-31 17:33:04,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:04,139 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-31 17:33:04,140 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-31 17:33:04,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:33:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:04,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:08,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:08,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:08,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:08,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:08,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:08,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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:33:08,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:33:08,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:33:11,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-31 17:33:11,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:11,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:11,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:24,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:24,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-31 17:33:24,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:24,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 17:33:24,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 17:33:24,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 17:33:24,959 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-31 17:33:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:33:25,371 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-31 17:33:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-31 17:33:25,372 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-31 17:33:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:33:25,372 INFO L225 Difference]: With dead ends: 117 [2019-01-31 17:33:25,372 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:33:25,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 17:33:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:33:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-31 17:33:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-31 17:33:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-31 17:33:25,377 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-31 17:33:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:33:25,377 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-31 17:33:25,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 17:33:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-31 17:33:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-31 17:33:25,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:33:25,378 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-31 17:33:25,378 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:33:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:33:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-31 17:33:25,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:33:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:25,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:33:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:33:25,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:33:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:29,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:29,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:29,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:29,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:29,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:33:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:33:30,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:33:30,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:33:30,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:30,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:30,136 INFO L316 TraceCheckSpWp]: Computing backward predicates...