java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 16:54:12,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 16:54:12,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 16:54:12,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 16:54:12,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 16:54:12,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 16:54:12,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 16:54:12,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 16:54:12,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 16:54:12,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 16:54:12,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 16:54:12,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 16:54:12,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 16:54:12,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 16:54:12,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 16:54:12,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 16:54:12,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 16:54:12,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 16:54:12,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 16:54:12,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 16:54:12,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 16:54:12,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 16:54:12,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 16:54:12,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 16:54:12,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 16:54:12,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 16:54:12,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 16:54:12,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 16:54:12,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 16:54:12,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 16:54:12,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 16:54:12,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 16:54:12,329 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 16:54:12,329 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 16:54:12,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 16:54:12,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 16:54:12,332 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 16:54:12,358 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 16:54:12,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 16:54:12,360 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 16:54:12,361 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 16:54:12,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 16:54:12,364 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 16:54:12,364 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 16:54:12,365 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 16:54:12,365 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 16:54:12,365 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 16:54:12,365 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 16:54:12,365 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 16:54:12,365 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 16:54:12,366 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 16:54:12,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 16:54:12,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 16:54:12,367 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 16:54:12,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 16:54:12,367 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 16:54:12,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 16:54:12,368 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 16:54:12,368 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 16:54:12,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 16:54:12,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 16:54:12,369 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 16:54:12,369 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 16:54:12,369 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 16:54:12,369 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 16:54:12,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 16:54:12,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 16:54:12,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 16:54:12,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:12,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 16:54:12,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 16:54:12,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 16:54:12,371 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 16:54:12,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 16:54:12,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 16:54:12,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 16:54:12,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 16:54:12,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 16:54:12,414 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 16:54:12,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 16:54:12,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 16:54:12,420 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 16:54:12,421 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 16:54:12,421 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-01-31 16:54:12,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 16:54:12,458 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 16:54:12,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 16:54:12,459 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 16:54:12,476 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,486 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:12,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 16:54:12,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 16:54:12,507 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,507 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,508 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,508 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,512 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,513 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,514 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 04:54:12" (1/1) ... [2019-01-31 16:54:12,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 16:54:12,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 16:54:12,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 16:54:12,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 16:54:12,518 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 04:54:12" (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 16:54:12,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 16:54:12,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 16:54:12,781 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 16:54:12,782 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 16:54:12,783 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:12 BoogieIcfgContainer [2019-01-31 16:54:12,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 16:54:12,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 16:54:12,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 16:54:12,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 16:54:12,789 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 04:54:12" (1/2) ... [2019-01-31 16:54:12,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411f59e4 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:54:12, skipping insertion in model container [2019-01-31 16:54:12,791 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 04:54:12" (2/2) ... [2019-01-31 16:54:12,792 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-01-31 16:54:12,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 16:54:12,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 16:54:12,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 16:54:12,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 16:54:12,863 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 16:54:12,863 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 16:54:12,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 16:54:12,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 16:54:12,864 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 16:54:12,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 16:54:12,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 16:54:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 16:54:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 16:54:12,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:12,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 16:54:12,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-31 16:54:12,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:12,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:12,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,072 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 16:54:13,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 16:54:13,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:13,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 16:54:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 16:54:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:13,096 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 16:54:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,145 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 16:54:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 16:54:13,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 16:54:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,159 INFO L225 Difference]: With dead ends: 9 [2019-01-31 16:54:13,159 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 16:54:13,163 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 16:54:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 16:54:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 16:54:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 16:54:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 16:54:13,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 16:54:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,199 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 16:54:13,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 16:54:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 16:54:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 16:54:13,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 16:54:13,200 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-31 16:54:13,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,327 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 16:54:13,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:13,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 16:54:13,331 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-31 16:54:13,379 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 16:54:13,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 16:54:13,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 16:54:13,484 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 16:54:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 16:54:13,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,492 INFO 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 16:54:13,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:13,601 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 16:54:13,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:13,811 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 16:54:13,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:13,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 16:54:13,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:13,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 16:54:13,835 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-31 16:54:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:13,861 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 16:54:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 16:54:13,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 16:54:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:13,877 INFO L225 Difference]: With dead ends: 8 [2019-01-31 16:54:13,877 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 16:54:13,878 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 16:54:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 16:54:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 16:54:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 16:54:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 16:54:13,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 16:54:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:13,881 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 16:54:13,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 16:54:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 16:54:13,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:13,882 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 16:54:13,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:13,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:13,884 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-31 16:54:13,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:13,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:13,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:13,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:13,939 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 16:54:13,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:13,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:13,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:13,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:13,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:13,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:13,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:13,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 16:54:13,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:13,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:13,989 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 16:54:13,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,111 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 16:54:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-31 16:54:14,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:14,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 16:54:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 16:54:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 16:54:14,130 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-31 16:54:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:14,204 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 16:54:14,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 16:54:14,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 16:54:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:14,205 INFO L225 Difference]: With dead ends: 9 [2019-01-31 16:54:14,205 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 16:54:14,206 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 16:54:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 16:54:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 16:54:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 16:54:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 16:54:14,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-31 16:54:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:14,209 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 16:54:14,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 16:54:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 16:54:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 16:54:14,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:14,210 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 16:54:14,210 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-31 16:54:14,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,385 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 16:54:14,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:14,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:14,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:14,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,387 INFO 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 16:54:14,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:14,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:14,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:14,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:14,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,461 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 16:54:14,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:14,748 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 16:54:14,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:14,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-31 16:54:14,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:14,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 16:54:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 16:54:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:14,771 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-31 16:54:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:14,784 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-31 16:54:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 16:54:14,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-31 16:54:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:14,785 INFO L225 Difference]: With dead ends: 10 [2019-01-31 16:54:14,785 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 16:54:14,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 16:54:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 16:54:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 16:54:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 16:54:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 16:54:14,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-31 16:54:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:14,789 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 16:54:14,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 16:54:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 16:54:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 16:54:14,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:14,790 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-31 16:54:14,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:14,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-31 16:54:14,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:14,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:14,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:14,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,966 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 16:54:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:14,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:14,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:14,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:14,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:14,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:14,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:14,998 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 16:54:14,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,118 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 16:54:15,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-31 16:54:15,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 16:54:15,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 16:54:15,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 16:54:15,139 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-31 16:54:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,165 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-31 16:54:15,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 16:54:15,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 16:54:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,167 INFO L225 Difference]: With dead ends: 11 [2019-01-31 16:54:15,167 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 16:54:15,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 16:54:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 16:54:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-31 16:54:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 16:54:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-31 16:54:15,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-31 16:54:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,171 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-31 16:54:15,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 16:54:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-31 16:54:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 16:54:15,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,172 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-31 16:54:15,172 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-31 16:54:15,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,285 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 16:54:15,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,286 INFO 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 16:54:15,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:15,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:15,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 16:54:15,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:15,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,359 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 16:54:15,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:15,728 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 16:54:15,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:15,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-31 16:54:15,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:15,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 16:54:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 16:54:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:15,749 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-31 16:54:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:15,788 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-31 16:54:15,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 16:54:15,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-31 16:54:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:15,790 INFO L225 Difference]: With dead ends: 12 [2019-01-31 16:54:15,790 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 16:54:15,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 16:54:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-31 16:54:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 16:54:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-31 16:54:15,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-31 16:54:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:15,794 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-31 16:54:15,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 16:54:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-31 16:54:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 16:54:15,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:15,795 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-31 16:54:15,795 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-31 16:54:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:15,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:15,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:15,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:15,902 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 16:54:15,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:15,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:15,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:15,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:15,904 INFO 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 16:54:15,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:15,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:15,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:15,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:15,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:15,947 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 16:54:15,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,063 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 16:54:16,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-31 16:54:16,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 16:54:16,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 16:54:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 16:54:16,085 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-31 16:54:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:16,134 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-31 16:54:16,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 16:54:16,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-31 16:54:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:16,136 INFO L225 Difference]: With dead ends: 13 [2019-01-31 16:54:16,136 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 16:54:16,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-31 16:54:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 16:54:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 16:54:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 16:54:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-31 16:54:16,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-31 16:54:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:16,140 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-31 16:54:16,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 16:54:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-31 16:54:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 16:54:16,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:16,140 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-31 16:54:16,140 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-31 16:54:16,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:16,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:16,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,318 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 16:54:16,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,319 INFO 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 16:54:16,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:16,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,350 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 16:54:16,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:16,579 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 16:54:16,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:16,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-31 16:54:16,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:16,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 16:54:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 16:54:16,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 16:54:16,601 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-31 16:54:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:16,628 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-31 16:54:16,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 16:54:16,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-31 16:54:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:16,630 INFO L225 Difference]: With dead ends: 14 [2019-01-31 16:54:16,631 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 16:54:16,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-31 16:54:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 16:54:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 16:54:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 16:54:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-31 16:54:16,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-31 16:54:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:16,634 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-31 16:54:16,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 16:54:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 16:54:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 16:54:16,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:16,635 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-31 16:54:16,635 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-31 16:54:16,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:16,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:16,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:16,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:16,750 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 16:54:16,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:16,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:16,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:16,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:16,752 INFO 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 16:54:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:16,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:16,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-31 16:54:16,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:16,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:16,804 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 16:54:16,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,029 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 16:54:17,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-31 16:54:17,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 16:54:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 16:54:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:17,053 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-31 16:54:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:17,082 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-31 16:54:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 16:54:17,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-31 16:54:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:17,083 INFO L225 Difference]: With dead ends: 15 [2019-01-31 16:54:17,083 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 16:54:17,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 16:54:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 16:54:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 16:54:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-31 16:54:17,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-31 16:54:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:17,088 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-31 16:54:17,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 16:54:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-31 16:54:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 16:54:17,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:17,088 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-31 16:54:17,089 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-31 16:54:17,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:17,452 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 16:54:17,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:17,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:17,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 16:54:17,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:17,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 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 16:54:17,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:17,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:17,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:17,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:17,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:17,495 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 16:54:17,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:17,797 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 16:54:17,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:17,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-31 16:54:17,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:17,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 16:54:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 16:54:17,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:17,819 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-31 16:54:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:17,884 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-31 16:54:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 16:54:17,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-31 16:54:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:17,885 INFO L225 Difference]: With dead ends: 16 [2019-01-31 16:54:17,886 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 16:54:17,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-31 16:54:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 16:54:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-31 16:54:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 16:54:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-31 16:54:17,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-31 16:54:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:17,890 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-31 16:54:17,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 16:54:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-31 16:54:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-31 16:54:17,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:17,891 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-31 16:54:17,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-31 16:54:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:17,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,091 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 16:54:18,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,092 INFO 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 16:54:18,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:18,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,122 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 16:54:18,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:18,327 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 16:54:18,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:18,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-31 16:54:18,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:18,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 16:54:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 16:54:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 16:54:18,348 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-31 16:54:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:18,387 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-31 16:54:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 16:54:18,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-31 16:54:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:18,389 INFO L225 Difference]: With dead ends: 17 [2019-01-31 16:54:18,389 INFO L226 Difference]: Without dead ends: 15 [2019-01-31 16:54:18,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-31 16:54:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-31 16:54:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-31 16:54:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 16:54:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-31 16:54:18,394 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-31 16:54:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:18,394 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-31 16:54:18,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 16:54:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-31 16:54:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-31 16:54:18,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:18,395 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-31 16:54:18,395 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:18,395 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-31 16:54:18,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:18,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:18,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:18,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:18,672 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 16:54:18,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:18,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:18,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:18,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:18,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 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 16:54:18,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:18,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:18,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-31 16:54:18,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:18,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:18,706 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 16:54:18,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:19,057 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 16:54:19,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:19,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-31 16:54:19,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:19,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 16:54:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 16:54:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:19,082 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-31 16:54:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:19,114 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-31 16:54:19,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 16:54:19,119 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-31 16:54:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:19,120 INFO L225 Difference]: With dead ends: 18 [2019-01-31 16:54:19,120 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 16:54:19,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 16:54:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-31 16:54:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 16:54:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-31 16:54:19,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-31 16:54:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:19,123 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-31 16:54:19,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 16:54:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-31 16:54:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-31 16:54:19,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:19,124 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-31 16:54:19,125 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-31 16:54:19,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:19,326 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 16:54:19,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:19,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:19,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:19,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:19,327 INFO 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 16:54:19,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:19,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:19,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:19,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:19,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:19,386 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 16:54:19,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:19,812 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 16:54:19,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:19,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-31 16:54:19,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-31 16:54:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-31 16:54:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-31 16:54:19,832 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-31 16:54:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:19,889 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-31 16:54:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 16:54:19,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-31 16:54:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:19,890 INFO L225 Difference]: With dead ends: 19 [2019-01-31 16:54:19,890 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 16:54:19,891 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 16:54:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 16:54:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 16:54:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 16:54:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-31 16:54:19,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-31 16:54:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:19,895 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-31 16:54:19,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-31 16:54:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-31 16:54:19,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 16:54:19,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:19,896 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-31 16:54:19,896 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:19,896 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-31 16:54:19,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:19,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:19,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:19,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,060 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 16:54:20,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:20,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:20,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:20,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,061 INFO 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 16:54:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:20,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:20,097 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 16:54:20,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:20,535 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 16:54:20,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:20,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-31 16:54:20,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:20,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 16:54:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 16:54:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-31 16:54:20,556 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-31 16:54:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:20,589 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-31 16:54:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 16:54:20,596 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-31 16:54:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:20,597 INFO L225 Difference]: With dead ends: 20 [2019-01-31 16:54:20,597 INFO L226 Difference]: Without dead ends: 18 [2019-01-31 16:54:20,598 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 16:54:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-31 16:54:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-31 16:54:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 16:54:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-31 16:54:20,604 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-31 16:54:20,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:20,604 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-31 16:54:20,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 16:54:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-31 16:54:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-31 16:54:20,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:20,606 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-31 16:54:20,606 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-31 16:54:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:20,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:20,976 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 16:54:20,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:20,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:20,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:20,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:20,977 INFO 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 16:54:20,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:20,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:21,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 16:54:21,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:21,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:21,016 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 16:54:21,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:21,367 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 16:54:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-31 16:54:21,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:21,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 16:54:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 16:54:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:21,388 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-31 16:54:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:21,418 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-31 16:54:21,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 16:54:21,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-31 16:54:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:21,420 INFO L225 Difference]: With dead ends: 21 [2019-01-31 16:54:21,420 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 16:54:21,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 16:54:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 16:54:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 16:54:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-31 16:54:21,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-31 16:54:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:21,425 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-31 16:54:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 16:54:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-31 16:54:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 16:54:21,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:21,426 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-31 16:54:21,426 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-31 16:54:21,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:21,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:21,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:21,631 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 16:54:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:21,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:21,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:21,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 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 16:54:21,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:21,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:21,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:21,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:21,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:21,666 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 16:54:21,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:22,319 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 16:54:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-31 16:54:22,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:22,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 16:54:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 16:54:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:22,340 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-31 16:54:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:22,389 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-31 16:54:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 16:54:22,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-31 16:54:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:22,390 INFO L225 Difference]: With dead ends: 22 [2019-01-31 16:54:22,390 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 16:54:22,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 16:54:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 16:54:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-31 16:54:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 16:54:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-31 16:54:22,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-31 16:54:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:22,394 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-31 16:54:22,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 16:54:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-31 16:54:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-31 16:54:22,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:22,395 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-31 16:54:22,395 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:22,395 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-31 16:54:22,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:22,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:22,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:22,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:23,231 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 16:54:23,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:23,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:23,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:23,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:23,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:23,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:23,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:23,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:23,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 16:54:23,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:23,880 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 16:54:23,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:23,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-31 16:54:23,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:23,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-31 16:54:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-31 16:54:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:23,901 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-31 16:54:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:23,928 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-31 16:54:23,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 16:54:23,929 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-31 16:54:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:23,930 INFO L225 Difference]: With dead ends: 23 [2019-01-31 16:54:23,930 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 16:54:23,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-31 16:54:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 16:54:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 16:54:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 16:54:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-31 16:54:23,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-31 16:54:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:23,934 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-31 16:54:23,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-31 16:54:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-31 16:54:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 16:54:23,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:23,935 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-31 16:54:23,935 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-31 16:54:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:23,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:23,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:23,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:24,179 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 16:54:24,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:24,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:24,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:24,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:24,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:24,180 INFO 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 16:54:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:24,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:24,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-31 16:54:24,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:24,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:24,224 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 16:54:24,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:25,039 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 16:54:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-31 16:54:25,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:25,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 16:54:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 16:54:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:25,060 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-31 16:54:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:25,088 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-31 16:54:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 16:54:25,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-31 16:54:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:25,090 INFO L225 Difference]: With dead ends: 24 [2019-01-31 16:54:25,090 INFO L226 Difference]: Without dead ends: 22 [2019-01-31 16:54:25,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-31 16:54:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-31 16:54:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 16:54:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-31 16:54:25,094 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-31 16:54:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:25,094 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-31 16:54:25,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 16:54:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-31 16:54:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-31 16:54:25,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:25,095 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-31 16:54:25,096 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-31 16:54:25,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:25,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:25,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:25,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:25,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:25,936 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 16:54:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:25,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:25,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:25,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:25,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:25,937 INFO 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 16:54:25,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:25,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:25,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:25,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:25,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:25,991 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 16:54:25,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:26,401 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 16:54:26,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-31 16:54:26,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:26,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-31 16:54:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-31 16:54:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 16:54:26,424 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-31 16:54:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:26,464 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-31 16:54:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 16:54:26,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-31 16:54:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:26,465 INFO L225 Difference]: With dead ends: 25 [2019-01-31 16:54:26,465 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 16:54:26,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 16:54:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 16:54:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-31 16:54:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 16:54:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-31 16:54:26,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-31 16:54:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:26,470 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-31 16:54:26,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-31 16:54:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-31 16:54:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 16:54:26,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:26,471 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-31 16:54:26,472 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-31 16:54:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:26,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:26,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:26,714 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 16:54:26,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:26,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:26,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:26,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:26,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:26,715 INFO 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 16:54:26,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:26,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:26,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:26,769 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 16:54:26,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:27,304 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 16:54:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-31 16:54:27,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 16:54:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 16:54:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 16:54:27,325 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-31 16:54:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,373 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-31 16:54:27,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 16:54:27,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-31 16:54:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,375 INFO L225 Difference]: With dead ends: 26 [2019-01-31 16:54:27,375 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 16:54:27,376 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 16:54:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 16:54:27,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-31 16:54:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 16:54:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-31 16:54:27,379 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-31 16:54:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,380 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-31 16:54:27,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 16:54:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-31 16:54:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-31 16:54:27,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,380 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-31 16:54:27,381 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-31 16:54:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,194 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 16:54:28,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:28,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:28,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:28,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,195 INFO 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 16:54:28,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:28,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:28,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 16:54:28,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:28,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:28,247 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 16:54:28,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:28,751 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 16:54:28,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:28,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-31 16:54:28,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:28,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 16:54:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 16:54:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:28,774 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-31 16:54:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:28,814 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-31 16:54:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 16:54:28,814 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-31 16:54:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:28,815 INFO L225 Difference]: With dead ends: 27 [2019-01-31 16:54:28,816 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 16:54:28,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 16:54:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-31 16:54:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 16:54:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-31 16:54:28,820 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-31 16:54:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:28,821 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-31 16:54:28,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 16:54:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-31 16:54:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-31 16:54:28,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:28,822 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-31 16:54:28,822 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:28,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-31 16:54:28,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:28,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:28,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:29,195 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 16:54:29,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:29,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:29,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:29,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:29,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:29,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:29,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:29,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:29,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:29,234 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 16:54:29,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:29,887 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 16:54:29,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:29,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-31 16:54:29,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:29,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 16:54:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 16:54:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:29,908 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-31 16:54:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,986 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-31 16:54:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 16:54:29,989 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-31 16:54:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,989 INFO L225 Difference]: With dead ends: 28 [2019-01-31 16:54:29,989 INFO L226 Difference]: Without dead ends: 26 [2019-01-31 16:54:29,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-31 16:54:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-31 16:54:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-31 16:54:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 16:54:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-31 16:54:29,993 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-31 16:54:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-31 16:54:29,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 16:54:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-31 16:54:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-31 16:54:29,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,994 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-31 16:54:29,995 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-31 16:54:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,554 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 16:54:30,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:30,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:30,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:30,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,555 INFO 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 16:54:30,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:30,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:30,597 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 16:54:30,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:31,348 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 16:54:31,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:31,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-31 16:54:31,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:31,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-31 16:54:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-31 16:54:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 16:54:31,371 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-31 16:54:31,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:31,407 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-31 16:54:31,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 16:54:31,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-31 16:54:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:31,409 INFO L225 Difference]: With dead ends: 29 [2019-01-31 16:54:31,409 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 16:54:31,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-31 16:54:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 16:54:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-31 16:54:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 16:54:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-31 16:54:31,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-31 16:54:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:31,414 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-31 16:54:31,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-31 16:54:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-31 16:54:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 16:54:31,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:31,415 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-31 16:54:31,415 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:31,416 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-31 16:54:31,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:31,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:31,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,764 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 16:54:31,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:31,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:31,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:31,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:54:31,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:31,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:31,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 16:54:31,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:31,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:31,824 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 16:54:31,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:32,528 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 16:54:32,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:32,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-31 16:54:32,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:32,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 16:54:32,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 16:54:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:32,550 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-31 16:54:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:32,599 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-31 16:54:32,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 16:54:32,600 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-31 16:54:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:32,601 INFO L225 Difference]: With dead ends: 30 [2019-01-31 16:54:32,601 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 16:54:32,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 16:54:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-31 16:54:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 16:54:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-31 16:54:32,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-31 16:54:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:32,606 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-31 16:54:32,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 16:54:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-31 16:54:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-31 16:54:32,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:32,608 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-31 16:54:32,608 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:32,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-31 16:54:32,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:32,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:32,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,064 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 16:54:33,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:33,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:33,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 16:54:33,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,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 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 16:54:33,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:33,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:33,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:33,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:33,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:33,106 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 16:54:33,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:33,889 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 16:54:33,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:33,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-31 16:54:33,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:33,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 16:54:33,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 16:54:33,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 16:54:33,912 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-31 16:54:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:33,967 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-31 16:54:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 16:54:33,968 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-31 16:54:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:33,969 INFO L225 Difference]: With dead ends: 31 [2019-01-31 16:54:33,969 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 16:54:33,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-31 16:54:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 16:54:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-31 16:54:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 16:54:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-31 16:54:33,974 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-31 16:54:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:33,974 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-31 16:54:33,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 16:54:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-31 16:54:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-31 16:54:33,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:33,975 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-31 16:54:33,975 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:33,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:33,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-31 16:54:33,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:33,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:34,354 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 16:54:34,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:34,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:34,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:34,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:34,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:34,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 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 16:54:34,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:34,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:34,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:34,399 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 16:54:34,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:35,607 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 16:54:35,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:35,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-31 16:54:35,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:35,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 16:54:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 16:54:35,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:35,629 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-31 16:54:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:35,720 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-31 16:54:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 16:54:35,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-31 16:54:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:35,721 INFO L225 Difference]: With dead ends: 32 [2019-01-31 16:54:35,722 INFO L226 Difference]: Without dead ends: 30 [2019-01-31 16:54:35,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-31 16:54:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-31 16:54:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-31 16:54:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 16:54:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-31 16:54:35,726 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-31 16:54:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:35,726 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-31 16:54:35,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 16:54:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-31 16:54:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-31 16:54:35,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:35,727 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-31 16:54:35,727 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-31 16:54:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:35,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:36,418 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 16:54:36,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:36,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:36,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:36,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,419 INFO 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 16:54:36,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:36,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:36,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-31 16:54:36,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:36,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:36,488 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 16:54:36,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:37,326 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 16:54:37,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:37,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-31 16:54:37,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:37,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 16:54:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 16:54:37,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:37,346 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-31 16:54:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:37,504 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-31 16:54:37,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 16:54:37,505 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-31 16:54:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:37,505 INFO L225 Difference]: With dead ends: 33 [2019-01-31 16:54:37,505 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 16:54:37,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 16:54:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 16:54:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 16:54:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-31 16:54:37,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-31 16:54:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:37,509 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-31 16:54:37,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 16:54:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-31 16:54:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 16:54:37,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:37,510 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-31 16:54:37,510 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-31 16:54:37,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:38,258 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 16:54:38,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:38,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:38,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:38,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,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 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 16:54:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:38,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:38,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:38,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:38,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:38,308 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 16:54:38,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:39,145 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 16:54:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:39,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-31 16:54:39,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:39,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 16:54:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 16:54:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:39,165 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-31 16:54:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:39,198 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-31 16:54:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 16:54:39,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-31 16:54:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:39,200 INFO L225 Difference]: With dead ends: 34 [2019-01-31 16:54:39,200 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 16:54:39,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 16:54:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 16:54:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-31 16:54:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 16:54:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-31 16:54:39,205 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-31 16:54:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:39,205 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-31 16:54:39,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 16:54:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-31 16:54:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-31 16:54:39,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:39,206 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-31 16:54:39,206 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-31 16:54:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:39,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:39,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:39,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,621 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 16:54:39,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:39,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:39,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 16:54:39,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,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 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 16:54:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:39,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:39,669 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 16:54:39,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:40,597 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 16:54:40,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-31 16:54:40,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-31 16:54:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-31 16:54:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 16:54:40,617 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-31 16:54:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:40,704 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-31 16:54:40,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 16:54:40,705 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-31 16:54:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:40,705 INFO L225 Difference]: With dead ends: 35 [2019-01-31 16:54:40,705 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 16:54:40,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 16:54:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 16:54:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-31 16:54:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 16:54:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-31 16:54:40,709 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-31 16:54:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:40,710 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-31 16:54:40,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-31 16:54:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-31 16:54:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-31 16:54:40,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:40,711 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-31 16:54:40,711 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-31 16:54:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:41,442 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 16:54:41,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:41,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:41,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:41,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:41,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:41,443 INFO 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 16:54:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:41,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:41,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 16:54:41,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:41,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:41,523 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 16:54:41,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:42,545 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 16:54:42,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:42,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-31 16:54:42,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:42,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 16:54:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 16:54:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:42,565 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-31 16:54:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:42,621 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-31 16:54:42,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 16:54:42,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-31 16:54:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:42,623 INFO L225 Difference]: With dead ends: 36 [2019-01-31 16:54:42,623 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 16:54:42,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 16:54:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-31 16:54:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 16:54:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-31 16:54:42,626 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-31 16:54:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:42,627 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-31 16:54:42,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 16:54:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-31 16:54:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-31 16:54:42,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:42,627 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-31 16:54:42,628 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-31 16:54:42,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:42,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:42,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:42,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:42,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:43,491 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 16:54:43,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:43,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:43,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:43,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,492 INFO 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 16:54:43,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:43,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:43,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:43,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:43,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:43,542 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 16:54:43,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:44,631 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 16:54:44,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:44,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-31 16:54:44,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:44,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-31 16:54:44,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-31 16:54:44,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:54:44,651 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-31 16:54:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:44,749 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-31 16:54:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 16:54:44,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-31 16:54:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:44,751 INFO L225 Difference]: With dead ends: 37 [2019-01-31 16:54:44,751 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 16:54:44,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-31 16:54:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 16:54:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-31 16:54:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 16:54:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-31 16:54:44,755 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-31 16:54:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:44,755 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-31 16:54:44,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-31 16:54:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-31 16:54:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 16:54:44,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:44,756 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-31 16:54:44,756 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-31 16:54:44,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:44,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:44,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:45,201 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 16:54:45,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:45,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:45,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:45,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:45,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:45,202 INFO 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 16:54:45,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:45,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:45,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:45,247 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 16:54:45,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:46,305 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 16:54:46,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:46,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-31 16:54:46,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:46,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 16:54:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 16:54:46,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:46,326 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-31 16:54:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:46,412 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-31 16:54:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 16:54:46,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-31 16:54:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:46,413 INFO L225 Difference]: With dead ends: 38 [2019-01-31 16:54:46,413 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 16:54:46,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-31 16:54:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 16:54:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-31 16:54:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 16:54:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-31 16:54:46,418 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-31 16:54:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:46,419 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-31 16:54:46,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 16:54:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-31 16:54:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-31 16:54:46,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:46,419 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-31 16:54:46,419 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-31 16:54:46,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:46,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:46,880 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 16:54:46,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:46,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:46,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:46,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:46,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:46,882 INFO 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 16:54:46,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:46,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:46,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-31 16:54:46,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:46,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:46,976 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 16:54:46,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:48,512 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 16:54:48,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:48,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-31 16:54:48,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:48,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-31 16:54:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-31 16:54:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:54:48,533 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-31 16:54:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:48,575 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-31 16:54:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 16:54:48,576 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-31 16:54:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:48,577 INFO L225 Difference]: With dead ends: 39 [2019-01-31 16:54:48,577 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 16:54:48,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:54:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 16:54:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-31 16:54:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 16:54:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-31 16:54:48,581 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-31 16:54:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:48,582 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-31 16:54:48,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-31 16:54:48,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-31 16:54:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 16:54:48,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:48,582 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-31 16:54:48,583 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-31 16:54:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:48,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:48,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:49,283 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 16:54:49,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:49,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:49,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:49,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,285 INFO 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 16:54:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:49,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:49,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:49,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:49,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:49,345 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 16:54:49,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:50,587 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 16:54:50,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:50,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-31 16:54:50,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:50,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 16:54:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 16:54:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:50,607 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-31 16:54:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:50,669 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-31 16:54:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 16:54:50,669 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-31 16:54:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:50,670 INFO L225 Difference]: With dead ends: 40 [2019-01-31 16:54:50,670 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 16:54:50,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 16:54:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 16:54:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-31 16:54:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 16:54:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-31 16:54:50,675 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-31 16:54:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:50,675 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-31 16:54:50,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 16:54:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-31 16:54:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-31 16:54:50,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:50,676 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-31 16:54:50,676 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-31 16:54:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:50,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:50,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:51,447 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 16:54:51,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:51,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:51,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:51,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:51,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:51,448 INFO 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 16:54:51,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:51,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:51,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:51,507 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 16:54:51,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:52,817 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 16:54:52,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:52,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-31 16:54:52,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:52,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-31 16:54:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-31 16:54:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 16:54:52,836 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-31 16:54:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:52,904 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-31 16:54:52,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 16:54:52,904 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-31 16:54:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:52,905 INFO L225 Difference]: With dead ends: 41 [2019-01-31 16:54:52,905 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 16:54:52,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-31 16:54:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 16:54:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-31 16:54:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 16:54:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-31 16:54:52,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-31 16:54:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:52,909 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-31 16:54:52,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-31 16:54:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-31 16:54:52,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-31 16:54:52,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:52,910 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-31 16:54:52,910 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-31 16:54:52,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:52,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:52,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:53,793 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 16:54:53,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:53,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:53,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:53,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:53,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:53,794 INFO 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 16:54:53,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:53,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:53,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-31 16:54:53,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:53,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:53,914 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 16:54:53,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:55,292 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 16:54:55,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:55,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-31 16:54:55,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:55,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 16:54:55,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 16:54:55,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:54:55,313 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-31 16:54:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:55,361 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-31 16:54:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 16:54:55,362 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-31 16:54:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:55,362 INFO L225 Difference]: With dead ends: 42 [2019-01-31 16:54:55,363 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 16:54:55,363 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 16:54:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 16:54:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-31 16:54:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 16:54:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-31 16:54:55,366 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-31 16:54:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:55,366 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-31 16:54:55,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 16:54:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-31 16:54:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-31 16:54:55,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:55,367 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-31 16:54:55,367 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:55,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:55,367 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-31 16:54:55,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:55,976 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 16:54:55,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:55,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:55,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:55,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:55,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:55,977 INFO 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 16:54:55,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:55,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:56,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:56,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:56,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:56,029 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 16:54:56,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:57,533 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 16:54:57,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:57,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-31 16:54:57,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:57,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-31 16:54:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-31 16:54:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:54:57,554 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-31 16:54:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:57,612 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-31 16:54:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 16:54:57,613 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-31 16:54:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:57,613 INFO L225 Difference]: With dead ends: 43 [2019-01-31 16:54:57,613 INFO L226 Difference]: Without dead ends: 41 [2019-01-31 16:54:57,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-31 16:54:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-31 16:54:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-31 16:54:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 16:54:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-31 16:54:57,615 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-31 16:54:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:57,616 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-31 16:54:57,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-31 16:54:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-31 16:54:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-31 16:54:57,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:57,616 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-31 16:54:57,617 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:54:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-31 16:54:57,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:57,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:57,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:57,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:57,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:58,342 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 16:54:58,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:58,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:58,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:58,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:58,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:58,343 INFO 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 16:54:58,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:58,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:58,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:58,395 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 16:54:58,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:00,072 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 16:55:00,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:00,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-31 16:55:00,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:00,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 16:55:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 16:55:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 16:55:00,092 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-31 16:55:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:00,169 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-31 16:55:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 16:55:00,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-31 16:55:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:00,170 INFO L225 Difference]: With dead ends: 44 [2019-01-31 16:55:00,170 INFO L226 Difference]: Without dead ends: 42 [2019-01-31 16:55:00,171 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 16:55:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-31 16:55:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-31 16:55:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 16:55:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-31 16:55:00,173 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-31 16:55:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:00,174 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-31 16:55:00,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 16:55:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-31 16:55:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-31 16:55:00,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:00,175 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-31 16:55:00,175 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-31 16:55:00,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:00,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:00,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:01,158 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 16:55:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:01,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:01,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,158 INFO 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 16:55:01,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:01,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:01,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 16:55:01,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:01,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:01,283 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 16:55:01,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:02,946 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 16:55:02,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:02,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-31 16:55:02,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:02,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-31 16:55:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-31 16:55:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:02,967 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-31 16:55:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:03,024 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-31 16:55:03,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 16:55:03,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-31 16:55:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:03,025 INFO L225 Difference]: With dead ends: 45 [2019-01-31 16:55:03,025 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 16:55:03,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 16:55:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-31 16:55:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 16:55:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-31 16:55:03,028 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-31 16:55:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:03,028 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-31 16:55:03,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-31 16:55:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-31 16:55:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-31 16:55:03,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:03,029 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-31 16:55:03,029 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-31 16:55:03,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:03,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:04,045 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 16:55:04,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:04,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:04,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:04,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,047 INFO 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 16:55:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:04,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:04,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:04,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:04,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:04,099 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 16:55:04,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:05,784 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 16:55:05,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:05,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-31 16:55:05,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:05,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 16:55:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 16:55:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:55:05,804 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-31 16:55:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:05,873 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-31 16:55:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 16:55:05,873 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-31 16:55:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:05,874 INFO L225 Difference]: With dead ends: 46 [2019-01-31 16:55:05,874 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 16:55:05,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-31 16:55:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 16:55:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-31 16:55:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-31 16:55:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-31 16:55:05,876 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-31 16:55:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:05,876 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-31 16:55:05,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 16:55:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-31 16:55:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-31 16:55:05,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:05,877 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-31 16:55:05,877 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-31 16:55:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:05,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:05,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:06,557 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 16:55:06,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:06,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:06,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:06,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 16:55:06,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:06,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 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 16:55:06,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:06,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:06,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:06,617 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 16:55:06,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:08,380 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 16:55:08,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:08,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-31 16:55:08,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-31 16:55:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-31 16:55:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-31 16:55:08,399 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-31 16:55:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:08,534 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-31 16:55:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 16:55:08,535 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-31 16:55:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:08,535 INFO L225 Difference]: With dead ends: 47 [2019-01-31 16:55:08,535 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 16:55:08,536 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 16:55:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 16:55:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-31 16:55:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 16:55:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-31 16:55:08,537 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-31 16:55:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:08,537 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-31 16:55:08,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-31 16:55:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-31 16:55:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 16:55:08,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:08,538 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-31 16:55:08,538 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-31 16:55:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:08,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:08,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:09,491 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 16:55:09,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:09,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:09,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:09,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:09,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:09,491 INFO 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 16:55:09,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:09,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:09,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 16:55:09,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:09,658 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 16:55:09,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:11,552 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 16:55:11,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:11,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-31 16:55:11,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:11,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 16:55:11,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 16:55:11,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:11,572 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-31 16:55:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:11,647 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-31 16:55:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 16:55:11,647 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-31 16:55:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:11,648 INFO L225 Difference]: With dead ends: 48 [2019-01-31 16:55:11,648 INFO L226 Difference]: Without dead ends: 46 [2019-01-31 16:55:11,648 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 16:55:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-31 16:55:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-31 16:55:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 16:55:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-31 16:55:11,650 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-31 16:55:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:11,650 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-31 16:55:11,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 16:55:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-31 16:55:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-31 16:55:11,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:11,651 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-31 16:55:11,651 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-31 16:55:11,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:11,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:11,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:11,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:11,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:12,428 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 16:55:12,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:12,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:12,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:12,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:12,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:12,429 INFO 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 16:55:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:12,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:12,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:12,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:12,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:12,487 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 16:55:12,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:14,789 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 16:55:14,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:14,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-31 16:55:14,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:14,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-31 16:55:14,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-31 16:55:14,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:55:14,809 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-31 16:55:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:14,862 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-31 16:55:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 16:55:14,863 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-31 16:55:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:14,864 INFO L225 Difference]: With dead ends: 49 [2019-01-31 16:55:14,864 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 16:55:14,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-31 16:55:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 16:55:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-31 16:55:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 16:55:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-31 16:55:14,868 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-31 16:55:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:14,868 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-31 16:55:14,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-31 16:55:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-31 16:55:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 16:55:14,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:14,868 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-31 16:55:14,869 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-31 16:55:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:14,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:14,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:15,786 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 16:55:15,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:15,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:15,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:15,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:15,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:15,788 INFO 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 16:55:15,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:15,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:15,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:15,849 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 16:55:15,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:17,883 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 16:55:17,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:17,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-31 16:55:17,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:17,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 16:55:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 16:55:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:17,903 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-31 16:55:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:18,044 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-31 16:55:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 16:55:18,044 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-31 16:55:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:18,045 INFO L225 Difference]: With dead ends: 50 [2019-01-31 16:55:18,045 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 16:55:18,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-31 16:55:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 16:55:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-31 16:55:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 16:55:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-31 16:55:18,048 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-31 16:55:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:18,048 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-31 16:55:18,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 16:55:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-31 16:55:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-31 16:55:18,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:18,049 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-31 16:55:18,049 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-31 16:55:18,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:18,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:18,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:18,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:18,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:19,097 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 16:55:19,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:19,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:19,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:19,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:19,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:19,098 INFO 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 16:55:19,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:19,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:19,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-31 16:55:19,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:19,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:19,266 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 16:55:19,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:21,383 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 16:55:21,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:21,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-31 16:55:21,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:21,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 16:55:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 16:55:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:21,403 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-31 16:55:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:21,460 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-31 16:55:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 16:55:21,461 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-31 16:55:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:21,462 INFO L225 Difference]: With dead ends: 51 [2019-01-31 16:55:21,462 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 16:55:21,463 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 16:55:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 16:55:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-31 16:55:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 16:55:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-31 16:55:21,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-31 16:55:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:21,466 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-31 16:55:21,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 16:55:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-31 16:55:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 16:55:21,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:21,467 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-31 16:55:21,467 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-31 16:55:21,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:21,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:21,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:22,390 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 16:55:22,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:22,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:22,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:22,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:22,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:22,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:22,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:22,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:22,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:22,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:22,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:22,461 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 16:55:22,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:24,886 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 16:55:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:24,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-31 16:55:24,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:24,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 16:55:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 16:55:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:24,905 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-31 16:55:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:25,234 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-31 16:55:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 16:55:25,234 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-31 16:55:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:25,235 INFO L225 Difference]: With dead ends: 52 [2019-01-31 16:55:25,235 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 16:55:25,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 16:55:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 16:55:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-31 16:55:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 16:55:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-31 16:55:25,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-31 16:55:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:25,238 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-31 16:55:25,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 16:55:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-31 16:55:25,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-31 16:55:25,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:25,239 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-31 16:55:25,239 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-31 16:55:25,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:25,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:25,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:26,110 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 16:55:26,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:26,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:26,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:26,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:26,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:26,111 INFO 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 16:55:26,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:26,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:26,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:26,179 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 16:55:26,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:28,541 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 16:55:28,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:28,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-31 16:55:28,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:28,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-31 16:55:28,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-31 16:55:28,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 16:55:28,562 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-31 16:55:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:28,658 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-31 16:55:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 16:55:28,658 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-31 16:55:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:28,659 INFO L225 Difference]: With dead ends: 53 [2019-01-31 16:55:28,659 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 16:55:28,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-31 16:55:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 16:55:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-31 16:55:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 16:55:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-31 16:55:28,662 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-31 16:55:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:28,662 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-31 16:55:28,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-31 16:55:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-31 16:55:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-31 16:55:28,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:28,663 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-31 16:55:28,663 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-31 16:55:28,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:28,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:28,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:29,831 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 16:55:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:29,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:29,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:29,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:29,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:29,832 INFO 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 16:55:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:29,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:30,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 16:55:30,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:30,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:30,041 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 16:55:30,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:32,409 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 16:55:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-31 16:55:32,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:32,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 16:55:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 16:55:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:32,429 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-31 16:55:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:32,494 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-31 16:55:32,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 16:55:32,494 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-31 16:55:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:32,495 INFO L225 Difference]: With dead ends: 54 [2019-01-31 16:55:32,496 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 16:55:32,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 16:55:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-31 16:55:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 16:55:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-31 16:55:32,499 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-31 16:55:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:32,499 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-31 16:55:32,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 16:55:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-31 16:55:32,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 16:55:32,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:32,500 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-31 16:55:32,500 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-31 16:55:32,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:32,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:32,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:33,544 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 16:55:33,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:33,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:33,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:33,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 16:55:33,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:33,545 INFO 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 16:55:33,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:33,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:33,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:33,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:33,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:33,608 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 16:55:33,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:36,347 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 16:55:36,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:36,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-31 16:55:36,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:36,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-31 16:55:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-31 16:55:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:55:36,377 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-31 16:55:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:36,514 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-31 16:55:36,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 16:55:36,515 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-31 16:55:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:36,515 INFO L225 Difference]: With dead ends: 55 [2019-01-31 16:55:36,516 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 16:55:36,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-31 16:55:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 16:55:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-31 16:55:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 16:55:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-31 16:55:36,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-31 16:55:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-31 16:55:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-31 16:55:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-31 16:55:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-31 16:55:36,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:36,520 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-31 16:55:36,520 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-31 16:55:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:36,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:36,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:36,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:36,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:37,522 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 16:55:37,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:37,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:37,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:37,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:37,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:37,523 INFO 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 16:55:37,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:37,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:37,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:37,589 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 16:55:37,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:40,627 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 16:55:40,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:40,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-31 16:55:40,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:40,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 16:55:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 16:55:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:40,647 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-31 16:55:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:40,709 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-31 16:55:40,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 16:55:40,709 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-31 16:55:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:40,710 INFO L225 Difference]: With dead ends: 56 [2019-01-31 16:55:40,710 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 16:55:40,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 16:55:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 16:55:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-31 16:55:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 16:55:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-31 16:55:40,714 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-31 16:55:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:40,714 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-31 16:55:40,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 16:55:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-31 16:55:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-31 16:55:40,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:40,715 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-31 16:55:40,715 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:40,716 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-31 16:55:40,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:40,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:40,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:42,044 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 16:55:42,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:42,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:42,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:42,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:42,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:42,045 INFO 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 16:55:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:42,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:42,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-31 16:55:42,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:42,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:42,293 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 16:55:42,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:45,264 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 16:55:45,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:45,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-31 16:55:45,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:45,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 16:55:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 16:55:45,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:55:45,295 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-31 16:55:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:45,445 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-31 16:55:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 16:55:45,446 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-31 16:55:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:45,447 INFO L225 Difference]: With dead ends: 57 [2019-01-31 16:55:45,447 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 16:55:45,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:55:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 16:55:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-31 16:55:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 16:55:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-31 16:55:45,450 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-31 16:55:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:45,450 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-31 16:55:45,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 16:55:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-31 16:55:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-31 16:55:45,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:45,451 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-31 16:55:45,451 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-31 16:55:45,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:45,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:45,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:45,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:46,492 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 16:55:46,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:46,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:46,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:46,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:46,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:46,492 INFO 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 16:55:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:46,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:46,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:46,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:46,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:46,564 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 16:55:46,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:49,389 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 16:55:49,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-31 16:55:49,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:49,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 16:55:49,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 16:55:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:55:49,411 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-31 16:55:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:49,557 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-31 16:55:49,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 16:55:49,558 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-31 16:55:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:49,558 INFO L225 Difference]: With dead ends: 58 [2019-01-31 16:55:49,558 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 16:55:49,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 16:55:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 16:55:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-31 16:55:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 16:55:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-31 16:55:49,561 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-31 16:55:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:49,562 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-31 16:55:49,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 16:55:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-31 16:55:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 16:55:49,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:49,562 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-31 16:55:49,562 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:49,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-31 16:55:49,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:49,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:49,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:49,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:50,711 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 16:55:50,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:50,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:50,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:50,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:50,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:50,712 INFO 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 16:55:50,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:50,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:50,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:50,779 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 16:55:50,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:53,647 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 16:55:53,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:53,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-31 16:55:53,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:53,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 16:55:53,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 16:55:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 16:55:53,668 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-31 16:55:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:53,771 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-31 16:55:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 16:55:53,772 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-31 16:55:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:53,772 INFO L225 Difference]: With dead ends: 59 [2019-01-31 16:55:53,772 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 16:55:53,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-31 16:55:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 16:55:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-31 16:55:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 16:55:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-31 16:55:53,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-31 16:55:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:53,775 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-31 16:55:53,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 16:55:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-31 16:55:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 16:55:53,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:53,776 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-31 16:55:53,776 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-31 16:55:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:53,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:53,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:55,366 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 16:55:55,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:55,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:55,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:55,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:55,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:55,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:55,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:55,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:55,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-31 16:55:55,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:55,649 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 16:55:55,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:58,565 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 16:55:58,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:58,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-31 16:55:58,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:58,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-31 16:55:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-31 16:55:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:55:58,586 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-31 16:55:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:58,656 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-31 16:55:58,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 16:55:58,657 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-31 16:55:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:58,658 INFO L225 Difference]: With dead ends: 60 [2019-01-31 16:55:58,658 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 16:55:58,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:55:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 16:55:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-31 16:55:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 16:55:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-31 16:55:58,662 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-31 16:55:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:58,663 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-31 16:55:58,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-31 16:55:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-31 16:55:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-31 16:55:58,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:58,663 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-31 16:55:58,664 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:55:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-31 16:55:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:58,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:58,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:58,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:00,184 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 16:56:00,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:00,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:00,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:00,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:00,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:00,185 INFO 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 16:56:00,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:00,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:00,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:00,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:00,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:00,256 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 16:56:00,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:03,411 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 16:56:03,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:03,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-31 16:56:03,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:03,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-31 16:56:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-31 16:56:03,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 16:56:03,432 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-31 16:56:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:03,526 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-31 16:56:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 16:56:03,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-31 16:56:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:03,527 INFO L225 Difference]: With dead ends: 61 [2019-01-31 16:56:03,527 INFO L226 Difference]: Without dead ends: 59 [2019-01-31 16:56:03,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-31 16:56:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-31 16:56:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-31 16:56:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 16:56:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-31 16:56:03,530 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-31 16:56:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-31 16:56:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-31 16:56:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-31 16:56:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 16:56:03,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:03,531 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-31 16:56:03,531 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-31 16:56:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:03,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:03,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:05,499 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 16:56:05,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:05,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:05,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:05,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:05,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:05,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 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 16:56:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:05,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:05,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:05,571 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 16:56:05,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:08,812 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 16:56:08,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:08,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-31 16:56:08,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:08,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 16:56:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 16:56:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 16:56:08,832 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-31 16:56:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:08,946 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-31 16:56:08,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 16:56:08,946 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-31 16:56:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:08,947 INFO L225 Difference]: With dead ends: 62 [2019-01-31 16:56:08,947 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 16:56:08,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 16:56:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 16:56:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-31 16:56:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-31 16:56:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-31 16:56:08,951 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-31 16:56:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:08,951 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-31 16:56:08,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 16:56:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-31 16:56:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-31 16:56:08,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:08,952 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-31 16:56:08,952 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:08,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-31 16:56:08,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:08,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:08,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:08,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:11,071 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 16:56:11,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:11,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:11,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:11,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:11,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:11,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:56:11,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:11,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:11,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-31 16:56:11,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:11,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:11,374 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 16:56:11,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:14,757 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 16:56:14,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:14,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-31 16:56:14,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:14,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 16:56:14,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 16:56:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 16:56:14,779 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-31 16:56:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:14,860 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-31 16:56:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 16:56:14,861 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-31 16:56:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:14,862 INFO L225 Difference]: With dead ends: 63 [2019-01-31 16:56:14,862 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 16:56:14,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 16:56:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 16:56:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-31 16:56:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 16:56:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-31 16:56:14,866 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-31 16:56:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:14,866 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-31 16:56:14,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 16:56:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-31 16:56:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-31 16:56:14,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:14,867 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-31 16:56:14,867 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:14,868 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-31 16:56:14,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:14,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:14,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:14,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:14,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:16,529 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 16:56:16,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:16,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:16,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:16,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:16,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:16,530 INFO 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 16:56:16,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:16,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:16,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:16,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:16,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:16,615 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 16:56:16,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:21,191 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 16:56:21,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:21,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-31 16:56:21,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:21,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-31 16:56:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-31 16:56:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:56:21,211 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-31 16:56:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:21,316 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-31 16:56:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 16:56:21,317 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-31 16:56:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:21,317 INFO L225 Difference]: With dead ends: 64 [2019-01-31 16:56:21,317 INFO L226 Difference]: Without dead ends: 62 [2019-01-31 16:56:21,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 16:56:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-31 16:56:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-31 16:56:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 16:56:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-31 16:56:21,320 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-31 16:56:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:21,320 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-31 16:56:21,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-31 16:56:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-31 16:56:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-31 16:56:21,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:21,321 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-31 16:56:21,321 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-31 16:56:21,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:21,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:21,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:21,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:21,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:23,107 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 16:56:23,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:23,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:23,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:23,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:23,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:23,108 INFO 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 16:56:23,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:23,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:23,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:23,187 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 16:56:23,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:27,359 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 16:56:27,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:27,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-31 16:56:27,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:27,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-31 16:56:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-31 16:56:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 16:56:27,380 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-31 16:56:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:27,469 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-31 16:56:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 16:56:27,469 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-31 16:56:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:27,470 INFO L225 Difference]: With dead ends: 65 [2019-01-31 16:56:27,470 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 16:56:27,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 16:56:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 16:56:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-31 16:56:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 16:56:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-31 16:56:27,473 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-31 16:56:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:27,474 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-31 16:56:27,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-31 16:56:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-31 16:56:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 16:56:27,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:27,474 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-31 16:56:27,474 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:27,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-31 16:56:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:27,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:27,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:28,787 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 16:56:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:28,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:28,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:28,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:28,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:28,788 INFO 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 16:56:28,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:28,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:29,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-31 16:56:29,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:29,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:29,161 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 16:56:29,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:33,160 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 16:56:33,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:33,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-31 16:56:33,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:33,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-31 16:56:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-31 16:56:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:56:33,182 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-31 16:56:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:33,259 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-31 16:56:33,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 16:56:33,259 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-31 16:56:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:33,260 INFO L225 Difference]: With dead ends: 66 [2019-01-31 16:56:33,260 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 16:56:33,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:56:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 16:56:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-31 16:56:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-31 16:56:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-31 16:56:33,263 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-31 16:56:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:33,263 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-31 16:56:33,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-31 16:56:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-31 16:56:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-31 16:56:33,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:33,264 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-31 16:56:33,264 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-31 16:56:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:33,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:33,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:34,691 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 16:56:34,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:34,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:34,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:34,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:34,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:34,691 INFO 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 16:56:34,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:34,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:34,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:34,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:34,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:34,766 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 16:56:34,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:38,803 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 16:56:38,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-31 16:56:38,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:38,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-31 16:56:38,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-31 16:56:38,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 16:56:38,823 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-31 16:56:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:38,964 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-31 16:56:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 16:56:38,964 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-31 16:56:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:38,965 INFO L225 Difference]: With dead ends: 67 [2019-01-31 16:56:38,965 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 16:56:38,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-31 16:56:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 16:56:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-31 16:56:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-31 16:56:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-31 16:56:38,968 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-31 16:56:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:38,968 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-31 16:56:38,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-31 16:56:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-31 16:56:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-31 16:56:38,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:38,968 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-31 16:56:38,968 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-31 16:56:38,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:38,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:38,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:38,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:40,436 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 16:56:40,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:40,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:40,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:40,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 16:56:40,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:40,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 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 16:56:40,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:40,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:40,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:40,510 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 16:56:40,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:44,620 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 16:56:44,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:44,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-31 16:56:44,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:44,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 16:56:44,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 16:56:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:56:44,640 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-31 16:56:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:44,774 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-31 16:56:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 16:56:44,775 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-31 16:56:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:44,776 INFO L225 Difference]: With dead ends: 68 [2019-01-31 16:56:44,776 INFO L226 Difference]: Without dead ends: 66 [2019-01-31 16:56:44,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 16:56:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-31 16:56:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-31 16:56:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 16:56:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-31 16:56:44,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-31 16:56:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:44,780 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-31 16:56:44,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 16:56:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-31 16:56:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-31 16:56:44,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:44,780 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-31 16:56:44,781 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-31 16:56:44,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:44,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:44,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:44,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:46,704 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 16:56:46,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:46,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:46,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:46,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:46,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:46,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:56:46,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:46,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:47,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-31 16:56:47,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:47,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:47,106 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 16:56:47,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:51,385 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 16:56:51,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:51,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-31 16:56:51,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:51,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 16:56:51,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 16:56:51,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 16:56:51,407 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-31 16:56:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:51,525 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-31 16:56:51,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 16:56:51,526 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-31 16:56:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:51,526 INFO L225 Difference]: With dead ends: 69 [2019-01-31 16:56:51,526 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 16:56:51,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 16:56:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 16:56:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-31 16:56:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 16:56:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-31 16:56:51,531 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-31 16:56:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:51,531 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-31 16:56:51,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 16:56:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-31 16:56:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 16:56:51,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:51,532 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-31 16:56:51,532 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-31 16:56:51,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:51,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:51,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:51,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:53,082 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 16:56:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:53,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:53,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:53,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:53,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:53,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:56:53,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:53,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:53,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:53,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:53,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:53,180 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 16:56:53,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:57,860 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 16:56:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:57,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-31 16:56:57,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:57,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-31 16:56:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-31 16:56:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 16:56:57,886 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-31 16:56:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:58,004 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-31 16:56:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 16:56:58,011 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-31 16:56:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:58,012 INFO L225 Difference]: With dead ends: 70 [2019-01-31 16:56:58,012 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 16:56:58,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 16:56:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 16:56:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-31 16:56:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-31 16:56:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-31 16:56:58,015 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-31 16:56:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:58,015 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-31 16:56:58,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-31 16:56:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-31 16:56:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-31 16:56:58,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:58,016 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-31 16:56:58,016 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:56:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-31 16:56:58,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:58,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:58,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:59,784 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 16:56:59,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:59,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:59,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:59,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:59,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:59,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:56:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:59,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:59,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:59,867 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 16:56:59,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:04,369 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 16:57:04,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:04,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-31 16:57:04,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:04,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-31 16:57:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-31 16:57:04,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 16:57:04,389 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-31 16:57:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:04,474 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-31 16:57:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 16:57:04,474 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-31 16:57:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:04,475 INFO L225 Difference]: With dead ends: 71 [2019-01-31 16:57:04,475 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 16:57:04,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-31 16:57:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 16:57:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-31 16:57:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 16:57:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-31 16:57:04,478 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-31 16:57:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:04,479 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-31 16:57:04,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-31 16:57:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-31 16:57:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-31 16:57:04,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:04,479 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-31 16:57:04,480 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-31 16:57:04,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:04,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:04,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:06,080 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 16:57:06,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:06,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:06,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:06,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:06,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:06,080 INFO 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 16:57:06,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:06,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:06,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-31 16:57:06,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:06,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:06,558 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 16:57:06,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:10,932 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 16:57:10,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:10,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-31 16:57:10,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:10,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-31 16:57:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-31 16:57:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:10,954 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-31 16:57:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:11,065 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-31 16:57:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 16:57:11,066 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-31 16:57:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:11,066 INFO L225 Difference]: With dead ends: 72 [2019-01-31 16:57:11,066 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 16:57:11,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:57:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 16:57:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-31 16:57:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-31 16:57:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-31 16:57:11,069 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-31 16:57:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:11,069 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-31 16:57:11,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-31 16:57:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-31 16:57:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-31 16:57:11,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:11,070 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-31 16:57:11,070 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-31 16:57:11,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:11,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:11,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:11,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:13,348 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 16:57:13,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:13,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:13,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:13,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:13,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:13,348 INFO 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 16:57:13,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:13,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:13,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:13,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:13,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:13,433 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 16:57:13,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:20,271 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 16:57:20,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:20,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-31 16:57:20,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:20,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-31 16:57:20,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-31 16:57:20,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 16:57:20,291 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-31 16:57:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:20,584 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-31 16:57:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 16:57:20,585 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-31 16:57:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:20,585 INFO L225 Difference]: With dead ends: 73 [2019-01-31 16:57:20,585 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 16:57:20,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-31 16:57:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 16:57:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-31 16:57:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 16:57:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-31 16:57:20,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-31 16:57:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:20,589 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-31 16:57:20,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-31 16:57:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-31 16:57:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-31 16:57:20,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:20,589 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-31 16:57:20,589 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-31 16:57:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:20,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:20,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:20,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:22,463 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 16:57:22,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:22,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:22,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:22,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:22,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:22,464 INFO 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 16:57:22,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:22,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:22,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:22,553 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 16:57:22,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:27,700 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 16:57:27,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:27,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-31 16:57:27,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:27,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 16:57:27,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 16:57:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-31 16:57:27,720 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-31 16:57:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:27,814 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-31 16:57:27,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 16:57:27,814 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-31 16:57:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:27,815 INFO L225 Difference]: With dead ends: 74 [2019-01-31 16:57:27,815 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 16:57:27,816 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 16:57:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 16:57:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-31 16:57:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 16:57:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-31 16:57:27,819 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-31 16:57:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-31 16:57:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 16:57:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-31 16:57:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-31 16:57:27,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:27,820 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-31 16:57:27,820 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-31 16:57:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:27,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:27,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:29,597 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 16:57:29,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:29,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:29,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:29,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:29,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:29,598 INFO 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 16:57:29,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:29,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:30,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-31 16:57:30,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:30,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:30,206 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 16:57:30,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:35,445 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 16:57:35,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:35,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-31 16:57:35,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:35,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 16:57:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 16:57:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 16:57:35,466 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-31 16:57:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:35,682 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-31 16:57:35,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 16:57:35,683 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-31 16:57:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:35,683 INFO L225 Difference]: With dead ends: 75 [2019-01-31 16:57:35,683 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 16:57:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 16:57:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 16:57:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-31 16:57:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 16:57:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-31 16:57:35,687 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-31 16:57:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:35,687 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-31 16:57:35,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 16:57:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-31 16:57:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 16:57:35,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:35,688 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-31 16:57:35,688 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-31 16:57:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:35,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:35,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:37,774 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 16:57:37,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:37,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:37,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:37,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:37,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:37,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:57:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:37,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:37,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:37,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:37,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:37,862 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 16:57:37,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:43,109 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 16:57:43,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:43,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-31 16:57:43,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:43,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-31 16:57:43,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-31 16:57:43,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:57:43,129 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-31 16:57:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:43,261 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-31 16:57:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 16:57:43,261 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-31 16:57:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:43,262 INFO L225 Difference]: With dead ends: 76 [2019-01-31 16:57:43,262 INFO L226 Difference]: Without dead ends: 74 [2019-01-31 16:57:43,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 16:57:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-31 16:57:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-31 16:57:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 16:57:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-31 16:57:43,265 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-31 16:57:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:43,266 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-31 16:57:43,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-31 16:57:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-31 16:57:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-31 16:57:43,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:43,267 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-31 16:57:43,267 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:43,267 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-31 16:57:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:43,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:43,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:45,080 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 16:57:45,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:45,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:45,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:45,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 16:57:45,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:45,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 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 16:57:45,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:45,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:45,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:45,165 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 16:57:45,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:50,630 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 16:57:50,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:50,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-31 16:57:50,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:50,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-31 16:57:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-31 16:57:50,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 16:57:50,651 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-31 16:57:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:50,858 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-31 16:57:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 16:57:50,859 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-31 16:57:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:50,859 INFO L225 Difference]: With dead ends: 77 [2019-01-31 16:57:50,859 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 16:57:50,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-31 16:57:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 16:57:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-31 16:57:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 16:57:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-31 16:57:50,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-31 16:57:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:50,864 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-31 16:57:50,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-31 16:57:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-31 16:57:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-31 16:57:50,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:50,865 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-31 16:57:50,865 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-31 16:57:50,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:50,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:50,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:50,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:50,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:53,027 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 16:57:53,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:53,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:53,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:53,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:53,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:53,028 INFO 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 16:57:53,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:53,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:53,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-31 16:57:53,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:53,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:53,697 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 16:57:53,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:59,346 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 16:57:59,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:59,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-31 16:57:59,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:59,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 16:57:59,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 16:57:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:57:59,369 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-31 16:57:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:59,508 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-31 16:57:59,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 16:57:59,508 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-31 16:57:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:59,509 INFO L225 Difference]: With dead ends: 78 [2019-01-31 16:57:59,509 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 16:57:59,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:57:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 16:57:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-31 16:57:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 16:57:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-31 16:57:59,513 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-31 16:57:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:59,513 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-31 16:57:59,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 16:57:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-31 16:57:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-31 16:57:59,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:59,514 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-31 16:57:59,514 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:57:59,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:59,514 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-31 16:57:59,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:59,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:59,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:59,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:01,466 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 16:58:01,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:01,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:01,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:01,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:01,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:01,467 INFO 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 16:58:01,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:01,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:01,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:01,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:01,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:01,560 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 16:58:01,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:07,373 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 16:58:07,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-31 16:58:07,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:07,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-31 16:58:07,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-31 16:58:07,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 16:58:07,394 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-31 16:58:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:07,540 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-31 16:58:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 16:58:07,540 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-31 16:58:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:07,541 INFO L225 Difference]: With dead ends: 79 [2019-01-31 16:58:07,541 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 16:58:07,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-31 16:58:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 16:58:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-31 16:58:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 16:58:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-31 16:58:07,544 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-31 16:58:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:07,544 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-31 16:58:07,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-31 16:58:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-31 16:58:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 16:58:07,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:07,545 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-31 16:58:07,545 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-31 16:58:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:07,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:07,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:07,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:09,803 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 16:58:09,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:09,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:09,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:09,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:09,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:09,804 INFO 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 16:58:09,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:09,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:09,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:09,892 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 16:58:09,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:15,749 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 16:58:15,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:15,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-31 16:58:15,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:15,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 16:58:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 16:58:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:58:15,768 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-31 16:58:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:15,920 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-31 16:58:15,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 16:58:15,920 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-31 16:58:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:15,920 INFO L225 Difference]: With dead ends: 80 [2019-01-31 16:58:15,921 INFO L226 Difference]: Without dead ends: 78 [2019-01-31 16:58:15,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 16:58:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-31 16:58:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-31 16:58:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 16:58:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-31 16:58:15,923 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-31 16:58:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:15,923 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-31 16:58:15,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 16:58:15,923 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-31 16:58:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-31 16:58:15,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:15,924 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-31 16:58:15,924 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-31 16:58:15,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:15,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:15,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:15,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:17,891 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 16:58:17,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:17,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:17,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:17,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 16:58:17,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:17,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 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 16:58:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:17,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:18,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-31 16:58:18,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:18,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:18,587 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 16:58:18,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:24,674 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 16:58:24,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:24,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-31 16:58:24,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:24,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 16:58:24,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 16:58:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 16:58:24,696 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-31 16:58:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:24,800 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-31 16:58:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 16:58:24,800 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-31 16:58:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:24,801 INFO L225 Difference]: With dead ends: 81 [2019-01-31 16:58:24,801 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 16:58:24,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 16:58:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 16:58:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-31 16:58:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 16:58:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-31 16:58:24,805 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-31 16:58:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:24,805 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-31 16:58:24,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 16:58:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-31 16:58:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-31 16:58:24,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:24,806 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-31 16:58:24,807 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:24,807 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-31 16:58:24,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:24,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:24,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:24,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:26,951 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 16:58:26,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:26,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:26,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:26,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:26,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:26,952 INFO 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 16:58:26,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:26,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:27,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:27,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:27,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:27,045 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 16:58:27,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:33,198 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 16:58:33,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:33,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-31 16:58:33,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:33,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-31 16:58:33,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-31 16:58:33,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 16:58:33,218 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-31 16:58:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:33,387 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-31 16:58:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-31 16:58:33,387 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-31 16:58:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:33,388 INFO L225 Difference]: With dead ends: 82 [2019-01-31 16:58:33,388 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 16:58:33,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-31 16:58:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 16:58:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-31 16:58:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 16:58:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-31 16:58:33,390 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-31 16:58:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:33,391 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-31 16:58:33,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-31 16:58:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-31 16:58:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-31 16:58:33,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:33,391 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-31 16:58:33,392 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:33,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-31 16:58:33,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:33,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:33,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:33,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:35,719 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 16:58:35,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:35,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:35,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:35,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:35,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:35,720 INFO 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 16:58:35,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:35,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:35,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:35,828 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 16:58:35,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:42,021 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 16:58:42,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:42,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-31 16:58:42,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:42,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-31 16:58:42,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-31 16:58:42,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 16:58:42,042 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-31 16:58:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:43,043 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-31 16:58:43,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 16:58:43,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-31 16:58:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:43,044 INFO L225 Difference]: With dead ends: 83 [2019-01-31 16:58:43,044 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 16:58:43,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 16:58:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 16:58:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-31 16:58:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 16:58:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-31 16:58:43,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-31 16:58:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:43,047 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-31 16:58:43,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-31 16:58:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-31 16:58:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-31 16:58:43,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:43,047 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-31 16:58:43,047 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-31 16:58:43,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:43,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:43,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:45,436 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 16:58:45,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:45,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:45,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:45,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 16:58:45,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:45,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 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 16:58:45,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:45,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:46,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-31 16:58:46,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:46,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:46,265 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 16:58:46,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:52,518 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 16:58:52,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:52,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-31 16:58:52,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:52,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 16:58:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 16:58:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:58:52,540 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-31 16:58:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:53,126 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-31 16:58:53,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 16:58:53,126 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-31 16:58:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:53,127 INFO L225 Difference]: With dead ends: 84 [2019-01-31 16:58:53,127 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 16:58:53,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:58:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 16:58:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-31 16:58:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-31 16:58:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-31 16:58:53,129 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-31 16:58:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:53,129 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-31 16:58:53,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 16:58:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-31 16:58:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-31 16:58:53,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:53,130 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-31 16:58:53,130 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:58:53,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:53,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-31 16:58:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:53,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:53,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:55,675 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 16:58:55,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:55,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:55,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:55,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:55,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:55,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 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 16:58:55,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:55,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:55,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:55,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:55,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:55,785 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 16:58:55,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:02,586 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 16:59:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:02,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-31 16:59:02,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:02,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-31 16:59:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-31 16:59:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 16:59:02,608 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-31 16:59:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:02,766 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-31 16:59:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 16:59:02,766 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-31 16:59:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:02,767 INFO L225 Difference]: With dead ends: 85 [2019-01-31 16:59:02,767 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 16:59:02,768 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 16:59:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 16:59:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-31 16:59:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-31 16:59:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-31 16:59:02,770 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-31 16:59:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-31 16:59:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-31 16:59:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-31 16:59:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-31 16:59:02,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:02,771 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-31 16:59:02,772 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-31 16:59:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:02,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:02,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:05,290 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 16:59:05,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:05,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:05,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:05,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 16:59:05,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:05,290 INFO 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 16:59:05,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:05,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:05,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:05,379 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 16:59:05,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:12,199 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 16:59:12,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:12,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-31 16:59:12,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:12,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 16:59:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 16:59:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:59:12,219 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-31 16:59:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:12,335 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-31 16:59:12,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-31 16:59:12,335 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-31 16:59:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:12,336 INFO L225 Difference]: With dead ends: 86 [2019-01-31 16:59:12,336 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 16:59:12,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:59:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 16:59:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-31 16:59:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 16:59:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-31 16:59:12,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-31 16:59:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:12,356 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-31 16:59:12,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 16:59:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-31 16:59:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-31 16:59:12,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:12,358 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-31 16:59:12,358 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-31 16:59:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:12,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:12,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:15,078 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 16:59:15,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:15,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:15,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:15,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:15,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:15,079 INFO 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 16:59:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:15,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:15,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-31 16:59:15,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:15,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:15,989 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 16:59:15,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:22,937 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 16:59:22,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:22,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-31 16:59:22,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:22,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 16:59:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 16:59:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 16:59:22,960 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-31 16:59:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:23,162 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-31 16:59:23,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 16:59:23,162 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-31 16:59:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:23,163 INFO L225 Difference]: With dead ends: 87 [2019-01-31 16:59:23,163 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 16:59:23,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 16:59:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 16:59:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-31 16:59:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-31 16:59:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-31 16:59:23,166 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-31 16:59:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:23,166 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-31 16:59:23,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 16:59:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-31 16:59:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-31 16:59:23,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:23,167 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-31 16:59:23,167 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-31 16:59:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:23,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:23,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:25,823 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 16:59:25,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:25,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:25,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:25,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:25,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:25,824 INFO 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 16:59:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:25,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:25,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:25,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:25,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:25,923 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 16:59:25,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:32,935 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 16:59:32,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:32,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-31 16:59:32,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:32,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-31 16:59:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-31 16:59:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 16:59:32,956 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-31 16:59:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:33,116 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-31 16:59:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-31 16:59:33,116 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-31 16:59:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:33,117 INFO L225 Difference]: With dead ends: 88 [2019-01-31 16:59:33,117 INFO L226 Difference]: Without dead ends: 86 [2019-01-31 16:59:33,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 16:59:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-31 16:59:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-31 16:59:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-31 16:59:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-31 16:59:33,120 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-31 16:59:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-31 16:59:33,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-31 16:59:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-31 16:59:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-31 16:59:33,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:33,121 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-31 16:59:33,121 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-31 16:59:33,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:33,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:33,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:35,838 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 16:59:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:35,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:35,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:35,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:35,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:59:35,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:35,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:35,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:35,955 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 16:59:35,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:43,481 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 16:59:43,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:43,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-31 16:59:43,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:43,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-31 16:59:43,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-31 16:59:43,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 16:59:43,501 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-31 16:59:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:43,640 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-31 16:59:43,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 16:59:43,641 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-31 16:59:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:43,641 INFO L225 Difference]: With dead ends: 89 [2019-01-31 16:59:43,641 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 16:59:43,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 16:59:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 16:59:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-31 16:59:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 16:59:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-31 16:59:43,644 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-31 16:59:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:43,645 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-31 16:59:43,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-31 16:59:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-31 16:59:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 16:59:43,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:43,645 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-31 16:59:43,646 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-31 16:59:43,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:43,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:43,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:43,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:46,361 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 16:59:46,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:46,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:46,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:46,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:46,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:46,362 INFO 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 16:59:46,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:46,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:47,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-31 16:59:47,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:47,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:47,442 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 16:59:47,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:54,825 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 16:59:54,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-31 16:59:54,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:54,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 16:59:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 16:59:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 16:59:54,848 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-31 16:59:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:54,997 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-31 16:59:54,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 16:59:54,998 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-31 16:59:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:54,998 INFO L225 Difference]: With dead ends: 90 [2019-01-31 16:59:54,998 INFO L226 Difference]: Without dead ends: 88 [2019-01-31 16:59:54,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 16:59:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-31 16:59:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-31 16:59:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-31 16:59:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-31 16:59:55,002 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-31 16:59:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:55,002 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-31 16:59:55,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 16:59:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-31 16:59:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-31 16:59:55,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:55,003 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-31 16:59:55,003 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 16:59:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-31 16:59:55,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:55,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:55,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:55,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:57,846 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 16:59:57,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:57,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:57,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:57,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:57,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:57,847 INFO 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 16:59:57,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:57,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:57,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:57,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:57,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:57,948 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 16:59:57,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:05,919 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:00:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:05,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-31 17:00:05,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:05,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-31 17:00:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-31 17:00:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:00:05,940 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-31 17:00:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:06,093 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-31 17:00:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:00:06,094 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-31 17:00:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:06,094 INFO L225 Difference]: With dead ends: 91 [2019-01-31 17:00:06,094 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:00:06,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:00:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:00:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-31 17:00:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-31 17:00:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-31 17:00:06,098 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-31 17:00:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:06,098 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-31 17:00:06,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-31 17:00:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-31 17:00:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-31 17:00:06,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:06,099 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-31 17:00:06,099 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-31 17:00:06,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:06,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:06,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:08,746 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:00:08,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:08,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:08,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:08,747 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:00:08,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:08,747 INFO 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:00:08,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:08,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:08,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:08,865 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:00:08,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:16,799 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:00:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:16,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-31 17:00:16,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:16,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 17:00:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 17:00:16,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:00:16,820 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-31 17:00:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:17,152 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-31 17:00:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-31 17:00:17,152 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-31 17:00:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:17,153 INFO L225 Difference]: With dead ends: 92 [2019-01-31 17:00:17,153 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:00:17,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:00:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:00:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-31 17:00:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-31 17:00:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-31 17:00:17,157 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-31 17:00:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:17,157 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-31 17:00:17,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 17:00:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-31 17:00:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-31 17:00:17,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:17,158 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-31 17:00:17,158 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-31 17:00:17,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:17,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:17,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:19,794 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:00:19,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:19,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:19,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:19,795 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:00:19,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:19,795 INFO 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:00:19,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:19,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:20,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-31 17:00:20,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:20,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:20,945 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:00:20,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:28,798 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:00:28,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:28,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-31 17:00:28,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:28,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:00:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:00:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:00:28,822 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-31 17:00:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:29,039 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-31 17:00:29,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:00:29,039 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-31 17:00:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:29,040 INFO L225 Difference]: With dead ends: 93 [2019-01-31 17:00:29,040 INFO L226 Difference]: Without dead ends: 91 [2019-01-31 17:00:29,041 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:00:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-31 17:00:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-31 17:00:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:00:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-31 17:00:29,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-31 17:00:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:29,044 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-31 17:00:29,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:00:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-31 17:00:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-31 17:00:29,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:29,045 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-31 17:00:29,045 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-31 17:00:29,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:29,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:29,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:32,029 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:00:32,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:32,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:32,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:32,030 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:00:32,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:32,030 INFO 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:00:32,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:32,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:32,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:32,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:32,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:32,144 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:00:32,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:40,363 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:00:40,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:40,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-31 17:00:40,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:40,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-31 17:00:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-31 17:00:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:00:40,384 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-31 17:00:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:40,512 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-31 17:00:40,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-31 17:00:40,513 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-31 17:00:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:40,514 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:00:40,514 INFO L226 Difference]: Without dead ends: 92 [2019-01-31 17:00:40,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:00:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-31 17:00:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-31 17:00:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-31 17:00:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-31 17:00:40,518 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-31 17:00:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:40,518 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-31 17:00:40,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-31 17:00:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-31 17:00:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-31 17:00:40,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:40,519 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-31 17:00:40,519 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-31 17:00:40,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:40,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:40,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:43,465 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:00:43,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:43,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:43,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:43,466 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:00:43,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:43,466 INFO 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:00:43,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:43,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:43,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:43,572 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:00:43,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:52,190 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:00:52,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:52,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-31 17:00:52,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:52,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-31 17:00:52,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-31 17:00:52,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:00:52,210 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-31 17:00:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:52,415 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-31 17:00:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-31 17:00:52,416 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-31 17:00:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:52,416 INFO L225 Difference]: With dead ends: 95 [2019-01-31 17:00:52,416 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:00:52,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:00:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:00:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-31 17:00:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:00:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-31 17:00:52,419 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-31 17:00:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:52,419 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-31 17:00:52,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-31 17:00:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-31 17:00:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-31 17:00:52,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:52,420 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-31 17:00:52,420 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:00:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-31 17:00:52,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:52,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:55,280 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:00:55,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:55,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:55,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:55,281 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:00:55,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:55,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00:55,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:55,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:56,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-31 17:00:56,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:56,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:56,633 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:00:56,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:05,316 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:01:05,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:05,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-31 17:01:05,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:05,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 17:01:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 17:01:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:01:05,340 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-31 17:01:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:05,475 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-31 17:01:05,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-31 17:01:05,476 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-31 17:01:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:05,477 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:01:05,477 INFO L226 Difference]: Without dead ends: 94 [2019-01-31 17:01:05,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:01:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-31 17:01:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-31 17:01:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-31 17:01:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-31 17:01:05,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-31 17:01:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:05,481 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-31 17:01:05,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 17:01:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-31 17:01:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-31 17:01:05,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:05,481 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-31 17:01:05,482 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-31 17:01:05,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:05,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:05,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:08,623 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:01:08,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:08,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:08,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:08,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:01:08,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:08,624 INFO 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:01:08,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:08,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:08,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:08,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:08,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:08,732 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:01:08,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:17,818 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:01:17,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:17,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-31 17:01:17,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:17,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-31 17:01:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-31 17:01:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:01:17,839 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-31 17:01:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:18,079 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-31 17:01:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-31 17:01:18,080 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-31 17:01:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:18,080 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:01:18,081 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 17:01:18,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:01:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 17:01:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-31 17:01:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:01:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-31 17:01:18,084 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-31 17:01:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:18,084 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-31 17:01:18,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-31 17:01:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-31 17:01:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-31 17:01:18,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:18,085 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-31 17:01:18,086 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-31 17:01:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:18,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:18,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:21,069 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:01:21,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:21,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:21,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:21,069 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:01:21,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:21,069 INFO 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:01:21,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:21,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:01:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:21,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:21,180 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:01:21,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:30,172 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:01:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-31 17:01:30,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:30,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 17:01:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 17:01:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:01:30,193 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-31 17:01:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:30,387 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-31 17:01:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-31 17:01:30,387 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-31 17:01:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:30,388 INFO L225 Difference]: With dead ends: 98 [2019-01-31 17:01:30,388 INFO L226 Difference]: Without dead ends: 96 [2019-01-31 17:01:30,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:01:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-31 17:01:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-31 17:01:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:01:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-31 17:01:30,391 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-31 17:01:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:30,391 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-31 17:01:30,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 17:01:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-31 17:01:30,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-31 17:01:30,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:30,392 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-31 17:01:30,392 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-31 17:01:30,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:30,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:30,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:30,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:30,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:33,722 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:01:33,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:33,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:33,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:33,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:01:33,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:33,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 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:01:33,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:33,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:35,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-31 17:01:35,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:35,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:35,178 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:01:35,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:44,587 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:01:44,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:44,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-31 17:01:44,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:44,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:01:44,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:01:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:01:44,609 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-31 17:01:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:44,762 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-31 17:01:44,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-31 17:01:44,763 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-31 17:01:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:44,764 INFO L225 Difference]: With dead ends: 99 [2019-01-31 17:01:44,764 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:01:44,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:01:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:01:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-31 17:01:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:01:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-31 17:01:44,767 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-31 17:01:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:44,767 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-31 17:01:44,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:01:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-31 17:01:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 17:01:44,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:44,767 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-31 17:01:44,768 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-31 17:01:44,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:44,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:44,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:47,951 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:01:47,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:47,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:47,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:47,951 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:01:47,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:47,951 INFO 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:01:47,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:47,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:48,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:48,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:48,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:48,062 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:01:48,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:57,326 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:01:57,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:57,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-31 17:01:57,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:57,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-31 17:01:57,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-31 17:01:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:01:57,347 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-31 17:01:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:57,490 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-31 17:01:57,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-31 17:01:57,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-31 17:01:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:57,492 INFO L225 Difference]: With dead ends: 100 [2019-01-31 17:01:57,492 INFO L226 Difference]: Without dead ends: 98 [2019-01-31 17:01:57,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:01:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-31 17:01:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-31 17:01:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:01:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-31 17:01:57,495 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-31 17:01:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:57,495 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-31 17:01:57,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-31 17:01:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-31 17:01:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-31 17:01:57,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:57,496 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-31 17:01:57,496 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:01:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-31 17:01:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:57,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:57,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:00,948 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:02:00,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:00,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:00,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:00,949 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:02:00,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:00,949 INFO 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:02:00,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:00,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:01,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:01,059 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:02:01,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:10,883 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:02:10,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:10,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-31 17:02:10,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:10,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-31 17:02:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-31 17:02:10,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:02:10,905 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-31 17:02:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:11,056 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-31 17:02:11,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-31 17:02:11,056 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-31 17:02:11,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:11,057 INFO L225 Difference]: With dead ends: 101 [2019-01-31 17:02:11,057 INFO L226 Difference]: Without dead ends: 99 [2019-01-31 17:02:11,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-31 17:02:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-31 17:02:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-31 17:02:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-31 17:02:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-31 17:02:11,061 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-31 17:02:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:11,061 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-31 17:02:11,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-31 17:02:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-31 17:02:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-31 17:02:11,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:11,062 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-31 17:02:11,062 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:11,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-31 17:02:11,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:11,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:11,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:14,604 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:02:14,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:14,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:14,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:14,605 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:02:14,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:14,605 INFO 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:02:14,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:14,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:16,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-31 17:02:16,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:16,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:16,295 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:02:16,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:26,091 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:02:26,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:26,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-31 17:02:26,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:26,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-31 17:02:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-31 17:02:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:02:26,114 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-31 17:02:26,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:26,283 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-31 17:02:26,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-31 17:02:26,284 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-31 17:02:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:26,284 INFO L225 Difference]: With dead ends: 102 [2019-01-31 17:02:26,284 INFO L226 Difference]: Without dead ends: 100 [2019-01-31 17:02:26,285 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:02:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-31 17:02:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-31 17:02:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:02:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-31 17:02:26,288 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-31 17:02:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:26,288 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-31 17:02:26,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-31 17:02:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-31 17:02:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-31 17:02:26,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:26,289 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-31 17:02:26,289 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:26,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:26,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-31 17:02:26,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:26,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:26,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:26,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:26,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:29,796 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:02:29,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:29,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:29,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:29,797 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:02:29,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:29,797 INFO 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:02:29,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:02:29,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:02:29,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:02:29,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:29,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:29,913 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:02:29,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:40,086 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:02:40,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:40,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-31 17:02:40,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:40,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-31 17:02:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-31 17:02:40,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:02:40,107 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-31 17:02:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:40,308 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-31 17:02:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-31 17:02:40,309 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-31 17:02:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:40,309 INFO L225 Difference]: With dead ends: 103 [2019-01-31 17:02:40,309 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:02:40,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:02:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:02:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-31 17:02:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:02:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-31 17:02:40,313 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-31 17:02:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:40,313 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-31 17:02:40,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-31 17:02:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-31 17:02:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:02:40,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:40,314 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-31 17:02:40,314 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-31 17:02:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:40,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:40,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:43,686 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:02:43,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:43,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:43,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:43,687 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:02:43,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02: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 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:02:43,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:43,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:43,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:43,797 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:02:43,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:54,274 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:02:54,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-31 17:02:54,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 17:02:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 17:02:54,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:02:54,295 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-31 17:02:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:54,599 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-31 17:02:54,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-31 17:02:54,599 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-31 17:02:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:54,599 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:02:54,600 INFO L226 Difference]: Without dead ends: 102 [2019-01-31 17:02:54,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-31 17:02:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-31 17:02:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-31 17:02:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:02:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-31 17:02:54,604 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-31 17:02:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-31 17:02:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 17:02:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-31 17:02:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-31 17:02:54,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:54,605 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-31 17:02:54,605 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:02:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:54,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-31 17:02:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:54,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:58,076 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:02:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:58,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:58,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:58,076 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:02:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:58,077 INFO 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:02:58,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:58,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:59,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-31 17:02:59,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:59,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:59,906 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:02:59,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:10,376 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:03:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-31 17:03:10,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:10,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:03:10,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:03:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:03:10,402 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-31 17:03:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:10,640 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-31 17:03:10,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-31 17:03:10,641 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-31 17:03:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:10,641 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:03:10,641 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:03:10,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-31 17:03:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:03:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-31 17:03:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:03:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-31 17:03:10,645 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-31 17:03:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:10,645 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-31 17:03:10,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:03:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-31 17:03:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-31 17:03:10,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:10,646 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-31 17:03:10,646 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:10,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:10,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-31 17:03:10,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:10,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:10,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:10,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:14,150 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:03:14,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:14,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:14,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:14,150 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:03:14,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:14,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:14,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:03:14,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:03:14,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:03:14,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:14,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:14,266 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:03:14,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:25,056 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:03:25,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:25,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-31 17:03:25,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:25,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-31 17:03:25,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-31 17:03:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-31 17:03:25,077 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-31 17:03:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:25,382 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-31 17:03:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-31 17:03:25,383 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-31 17:03:25,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:25,383 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:03:25,383 INFO L226 Difference]: Without dead ends: 104 [2019-01-31 17:03:25,385 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:03:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-31 17:03:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-31 17:03:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-31 17:03:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-31 17:03:25,387 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-31 17:03:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:25,387 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-31 17:03:25,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-31 17:03:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-31 17:03:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-31 17:03:25,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:25,388 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-31 17:03:25,388 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-31 17:03:25,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:25,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:25,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:25,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:28,909 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:03:28,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:28,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:28,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:28,909 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:03:28,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:28,909 INFO 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:03:28,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:28,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:03:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:29,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:29,026 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:03:29,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:40,065 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:03:40,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:40,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-31 17:03:40,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:40,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-31 17:03:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-31 17:03:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:03:40,086 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-31 17:03:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:40,268 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-31 17:03:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-31 17:03:40,268 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-31 17:03:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:40,269 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:03:40,269 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:03:40,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-31 17:03:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:03:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-31 17:03:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:03:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-31 17:03:40,273 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-31 17:03:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:40,274 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-31 17:03:40,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-31 17:03:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-31 17:03:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:03:40,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:40,275 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-31 17:03:40,275 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-31 17:03:40,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:40,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:40,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:44,285 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:03:44,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:44,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:44,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:44,286 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:03:44,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:44,286 INFO 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:03:44,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:03:44,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:03:46,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-31 17:03:46,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:46,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:46,425 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:03:46,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:57,404 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:03:57,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:57,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-31 17:03:57,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:57,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-31 17:03:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-31 17:03:57,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:03:57,429 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-31 17:03:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:57,768 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-31 17:03:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-31 17:03:57,768 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-31 17:03:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:57,769 INFO L225 Difference]: With dead ends: 108 [2019-01-31 17:03:57,769 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:03:57,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-31 17:03:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:03:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-31 17:03:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-31 17:03:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-31 17:03:57,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-31 17:03:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:57,774 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-31 17:03:57,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-31 17:03:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-31 17:03:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-31 17:03:57,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:57,775 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-31 17:03:57,775 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:03:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-31 17:03:57,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:57,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:57,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:57,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:01,763 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:04:01,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:01,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:01,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:01,763 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:04:01,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:01,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:01,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:01,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:01,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:01,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:01,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:01,894 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:04:01,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:13,261 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:04:13,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-31 17:04:13,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:13,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-31 17:04:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-31 17:04:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:04:13,283 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-31 17:04:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:13,583 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-31 17:04:13,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-31 17:04:13,583 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-31 17:04:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:13,584 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:04:13,584 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:04:13,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-31 17:04:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:04:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-31 17:04:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 17:04:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-31 17:04:13,588 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-31 17:04:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:13,588 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-31 17:04:13,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-31 17:04:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-31 17:04:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 17:04:13,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:13,589 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-31 17:04:13,589 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:13,590 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-31 17:04:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:13,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:13,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:13,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:13,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:17,673 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:04:17,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:17,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:17,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:17,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:04:17,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:17,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 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:04:17,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:17,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:04:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:17,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:17,804 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:04:17,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:29,523 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:04:29,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:29,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-31 17:04:29,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:29,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 17:04:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 17:04:29,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:04:29,546 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-31 17:04:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:29,801 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-31 17:04:29,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-31 17:04:29,802 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-31 17:04:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:29,802 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:04:29,802 INFO L226 Difference]: Without dead ends: 108 [2019-01-31 17:04:29,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-31 17:04:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-31 17:04:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-31 17:04:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:04:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-31 17:04:29,807 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-31 17:04:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:29,807 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-31 17:04:29,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 17:04:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-31 17:04:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-31 17:04:29,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:29,808 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-31 17:04:29,808 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-31 17:04:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:29,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:29,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:33,954 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:04:33,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:33,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:33,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:33,955 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:04:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:33,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:33,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:04:33,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:04:36,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-31 17:04:36,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:36,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:36,387 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:04:36,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:48,410 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:04:48,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:48,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-31 17:04:48,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:48,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:04:48,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:04:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:04:48,435 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-31 17:04:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:48,674 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-31 17:04:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-31 17:04:48,675 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-31 17:04:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:48,675 INFO L225 Difference]: With dead ends: 111 [2019-01-31 17:04:48,675 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:04:48,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-31 17:04:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:04:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-31 17:04:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-31 17:04:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-31 17:04:48,679 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-31 17:04:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:48,679 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-31 17:04:48,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:04:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-31 17:04:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-31 17:04:48,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:48,680 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-31 17:04:48,680 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:04:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-31 17:04:48,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:48,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:48,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:48,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:48,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:52,821 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:04:52,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:52,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:52,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:52,822 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:04:52,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:52,822 INFO 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:04:52,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:52,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:52,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:52,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:52,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:52,945 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:04:52,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:04,765 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:05:04,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:04,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-31 17:05:04,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:04,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-31 17:05:04,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-31 17:05:04,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-31 17:05:04,788 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-31 17:05:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:05,029 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-31 17:05:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-31 17:05:05,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-31 17:05:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:05,030 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:05:05,030 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:05:05,032 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:05:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:05:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-31 17:05:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-31 17:05:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-31 17:05:05,034 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-31 17:05:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:05,034 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-31 17:05:05,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-31 17:05:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-31 17:05:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-31 17:05:05,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:05,035 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-31 17:05:05,035 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-31 17:05:05,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:05,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:05,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:09,312 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:05:09,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:09,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:09,313 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:09,313 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:05:09,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:09,313 INFO 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:05:09,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:09,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:09,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:09,456 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:05:09,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:21,638 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:05:21,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:21,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-31 17:05:21,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:21,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-31 17:05:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-31 17:05:21,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 17:05:21,659 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-31 17:05:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:21,926 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-31 17:05:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-31 17:05:21,926 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-31 17:05:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:21,926 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:05:21,927 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:05:21,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-31 17:05:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:05:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-31 17:05:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:05:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-31 17:05:21,930 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-31 17:05:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:21,930 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-31 17:05:21,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-31 17:05:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-31 17:05:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-31 17:05:21,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:21,931 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-31 17:05:21,931 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:21,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:21,931 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-31 17:05:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:21,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:21,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:21,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:26,139 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:05:26,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:26,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:26,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:26,140 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:05:26,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:26,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05:26,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:05:26,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:05:28,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-31 17:05:28,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:28,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:28,887 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:05:28,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:41,432 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:05:41,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:41,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-31 17:05:41,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:41,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-31 17:05:41,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-31 17:05:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 17:05:41,458 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-31 17:05:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:41,810 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-31 17:05:41,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-31 17:05:41,811 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-31 17:05:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:41,811 INFO L225 Difference]: With dead ends: 114 [2019-01-31 17:05:41,811 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:05:41,812 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:05:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:05:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-31 17:05:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 17:05:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-31 17:05:41,814 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-31 17:05:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:41,815 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-31 17:05:41,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-31 17:05:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-31 17:05:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 17:05:41,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:41,816 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-31 17:05:41,816 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-31 17:05:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:41,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:41,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:46,168 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:05:46,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:46,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:46,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:46,168 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:05:46,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:46,168 INFO 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:05:46,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:05:46,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:05:46,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:05:46,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:46,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:46,294 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:05:46,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:59,114 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:05:59,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:59,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-31 17:05:59,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:59,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-31 17:05:59,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-31 17:05:59,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 17:05:59,137 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-31 17:05:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:59,403 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-31 17:05:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-31 17:05:59,403 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-31 17:05:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:59,404 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:05:59,404 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:05:59,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-31 17:05:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:05:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-31 17:05:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:05:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-31 17:05:59,409 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-31 17:05:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:59,409 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-31 17:05:59,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-31 17:05:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-31 17:05:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-31 17:05:59,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:59,410 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-31 17:05:59,410 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:05:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-31 17:05:59,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:59,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:59,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,658 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:06:03,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:03,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:03,659 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:06:03,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:03,659 INFO 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:06:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:03,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:03,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:03,785 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:06:03,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:16,692 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:06:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-31 17:06:16,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:16,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-31 17:06:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-31 17:06:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:06:16,714 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-31 17:06:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:16,943 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-31 17:06:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-31 17:06:16,943 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-31 17:06:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:16,944 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:06:16,944 INFO L226 Difference]: Without dead ends: 114 [2019-01-31 17:06:16,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-31 17:06:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-31 17:06:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-31 17:06:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-31 17:06:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-31 17:06:16,948 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-31 17:06:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:16,948 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-31 17:06:16,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-31 17:06:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-31 17:06:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-31 17:06:16,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:16,949 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-31 17:06:16,950 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-31 17:06:16,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:16,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:16,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:16,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:21,555 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:06:21,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:21,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:21,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:21,556 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:06:21,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:21,556 INFO 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:06:21,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:21,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:24,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-31 17:06:24,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:24,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:24,413 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:06:24,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:37,364 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:06:37,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:37,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-31 17:06:37,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:37,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 17:06:37,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 17:06:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 17:06:37,390 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-31 17:06:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:37,746 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-31 17:06:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-31 17:06:37,746 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-31 17:06:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:37,747 INFO L225 Difference]: With dead ends: 117 [2019-01-31 17:06:37,747 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:06:37,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-31 17:06:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:06:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-31 17:06:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-31 17:06:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-31 17:06:37,751 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-31 17:06:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:37,751 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-31 17:06:37,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 17:06:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-31 17:06:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-31 17:06:37,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:37,752 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-31 17:06:37,752 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-31 17:06:37,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:37,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,540 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:06:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:42,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:42,540 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:06:42,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,540 INFO 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:06:42,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:42,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:42,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:42,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:42,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:42,671 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:06:42,671 INFO L316 TraceCheckSpWp]: Computing backward predicates...