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-0ed9222-m [2019-01-11 14:10:21,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:10:21,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:10:21,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:10:21,846 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:10:21,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:10:21,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:10:21,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:10:21,852 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:10:21,853 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:10:21,854 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:10:21,855 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:10:21,855 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:10:21,856 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:10:21,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:10:21,858 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:10:21,859 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:10:21,861 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:10:21,863 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:10:21,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:10:21,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:10:21,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:10:21,870 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:10:21,870 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:10:21,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:10:21,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:10:21,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:10:21,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:10:21,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:10:21,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:10:21,883 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:10:21,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:10:21,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:10:21,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:10:21,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:10:21,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:10:21,889 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-11 14:10:21,917 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:10:21,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:10:21,918 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:10:21,921 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:10:21,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:10:21,922 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:10:21,922 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:10:21,922 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:10:21,923 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:10:21,923 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:10:21,923 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:10:21,923 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:10:21,923 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:10:21,924 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:10:21,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:10:21,925 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:10:21,926 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:10:21,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:10:21,926 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:10:21,926 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:10:21,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:10:21,928 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:10:21,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:10:21,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:10:21,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:10:21,929 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:10:21,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:10:21,929 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:10:21,929 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:10:21,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:10:21,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:10:21,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:21,930 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:10:21,930 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:10:21,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:10:21,931 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:10:21,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:10:21,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:10:21,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:10:21,932 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:10:21,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:10:21,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:10:22,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:10:22,007 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:10:22,008 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:10:22,008 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-11 14:10:22,009 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-01-11 14:10:22,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:10:22,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:10:22,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:22,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:10:22,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:10:22,076 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 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,089 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 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:22,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:10:22,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:10:22,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:10:22,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/1) ... [2019-01-11 14:10:22,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:10:22,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:10:22,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:10:22,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:10:22,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (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:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:10:22,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:10:22,363 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:10:22,364 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-11 14:10:22,365 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:22 BoogieIcfgContainer [2019-01-11 14:10:22,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:10:22,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:10:22,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:10:22,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:10:22,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:22" (1/2) ... [2019-01-11 14:10:22,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5839e0d7 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:10:22, skipping insertion in model container [2019-01-11 14:10:22,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:22" (2/2) ... [2019-01-11 14:10:22,375 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-01-11 14:10:22,385 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:10:22,394 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:10:22,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:10:22,454 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:10:22,454 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:10:22,454 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:10:22,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:10:22,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:10:22,455 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:10:22,455 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:10:22,455 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:10:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-11 14:10:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:10:22,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:22,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:10:22,492 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-11 14:10:22,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:22,632 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-11 14:10:22,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:22,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:10:22,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:22,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:10:22,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:10:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:22,652 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-11 14:10:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:22,699 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-11 14:10:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:10:22,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:10:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:22,713 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:10:22,713 INFO L226 Difference]: Without dead ends: 5 [2019-01-11 14:10:22,716 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-11 14:10:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-11 14:10:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-11 14:10:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-11 14:10:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-11 14:10:22,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-11 14:10:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:22,750 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-11 14:10:22,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:10:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-11 14:10:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:10:22,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:22,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:10:22,752 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-11 14:10:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:22,913 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-11 14:10:22,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:22,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:22,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:10:22,918 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-11 14:10:22,976 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:22,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:23,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:23,176 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-11 14:10:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:23,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:23,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,189 INFO 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-11 14:10:23,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:23,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:23,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:23,281 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-11 14:10:23,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:23,369 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-11 14:10:23,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:23,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-11 14:10:23,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:23,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:10:23,405 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-11 14:10:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:23,439 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-11 14:10:23,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:10:23,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:10:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:23,440 INFO L225 Difference]: With dead ends: 8 [2019-01-11 14:10:23,440 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 14:10:23,442 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-11 14:10:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 14:10:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 14:10:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 14:10:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-11 14:10:23,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-11 14:10:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:23,445 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-11 14:10:23,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-11 14:10:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:10:23,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:23,446 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:10:23,447 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:23,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-11 14:10:23,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:23,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:23,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:23,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:23,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:23,560 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-11 14:10:23,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:23,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:23,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:23,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,562 INFO 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-11 14:10:23,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:23,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:23,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:10:23,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:23,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:23,598 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-11 14:10:23,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:23,724 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-11 14:10:23,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:23,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-11 14:10:23,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:23,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:10:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:10:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:10:23,744 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-11 14:10:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:23,786 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-11 14:10:23,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:23,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-11 14:10:23,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:23,788 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:10:23,788 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 14:10:23,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:10:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 14:10:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 14:10:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:10:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-11 14:10:23,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-11 14:10:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:23,792 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-11 14:10:23,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:10:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-11 14:10:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:10:23,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:23,793 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 14:10:23,794 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-11 14:10:23,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:23,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:23,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:23,976 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-11 14:10:23,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:23,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:23,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:23,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,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 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-11 14:10:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:23,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:24,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:24,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:24,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:24,051 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-11 14:10:24,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:24,270 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-11 14:10:24,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:24,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-11 14:10:24,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:24,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:10:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:10:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:10:24,291 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-11 14:10:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:24,307 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-11 14:10:24,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:10:24,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-11 14:10:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:24,308 INFO L225 Difference]: With dead ends: 10 [2019-01-11 14:10:24,308 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 14:10:24,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:10:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 14:10:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 14:10:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:10:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-11 14:10:24,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-11 14:10:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-11 14:10:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:10:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-11 14:10:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:10:24,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:24,313 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-11 14:10:24,314 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-11 14:10:24,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:24,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:24,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:24,491 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-11 14:10:24,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:24,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:24,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:24,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,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 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-11 14:10:24,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:24,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:24,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:24,538 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-11 14:10:24,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:24,651 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-11 14:10:24,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:24,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-11 14:10:24,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:24,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:10:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:10:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:10:24,671 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-11 14:10:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:24,699 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-11 14:10:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:10:24,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:10:24,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:24,700 INFO L225 Difference]: With dead ends: 11 [2019-01-11 14:10:24,700 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:10:24,701 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-11 14:10:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:10:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 14:10:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:10:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-11 14:10:24,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-11 14:10:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:24,704 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-11 14:10:24,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:10:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-11 14:10:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:10:24,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:24,705 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-11 14:10:24,705 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-11 14:10:24,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:24,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:24,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:24,819 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-11 14:10:24,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:24,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:24,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:24,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,820 INFO 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-11 14:10:24,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:24,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:24,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:10:24,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:24,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:24,906 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-11 14:10:24,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:25,426 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-11 14:10:25,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:25,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-11 14:10:25,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:25,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:10:25,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:10:25,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:25,446 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-11 14:10:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:25,490 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-11 14:10:25,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:10:25,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-11 14:10:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:25,492 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:10:25,492 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 14:10:25,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 14:10:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-11 14:10:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 14:10:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-11 14:10:25,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-11 14:10:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:25,496 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-11 14:10:25,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:10:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-11 14:10:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:10:25,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:25,496 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-11 14:10:25,496 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-11 14:10:25,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:25,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:25,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:25,612 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-11 14:10:25,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:25,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:25,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:25,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:25,613 INFO 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-11 14:10:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:25,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:25,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:25,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:25,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:25,654 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-11 14:10:25,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:25,775 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-11 14:10:25,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-11 14:10:25,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:25,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:10:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:10:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:10:25,797 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-11 14:10:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:25,853 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-11 14:10:25,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:10:25,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-11 14:10:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:25,854 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:10:25,854 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:10:25,855 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-11 14:10:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:10:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 14:10:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:10:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 14:10:25,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-11 14:10:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:25,858 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 14:10:25,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:10:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 14:10:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:10:25,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:25,859 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-11 14:10:25,859 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:25,859 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-11 14:10:25,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:25,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:25,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:25,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,005 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-11 14:10:26,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:26,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:26,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:26,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,007 INFO 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-11 14:10:26,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:26,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:26,038 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-11 14:10:26,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:26,273 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-11 14:10:26,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:26,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-11 14:10:26,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:26,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:10:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:10:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:10:26,294 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-11 14:10:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:26,337 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-11 14:10:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:10:26,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-11 14:10:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:26,344 INFO L225 Difference]: With dead ends: 14 [2019-01-11 14:10:26,344 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:10:26,345 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-11 14:10:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:10:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 14:10:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:10:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-11 14:10:26,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-11 14:10:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:26,348 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-11 14:10:26,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:10:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-11 14:10:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 14:10:26,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:26,348 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-11 14:10:26,349 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:26,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-11 14:10:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:26,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,445 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-11 14:10:26,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:26,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:26,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:26,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,446 INFO 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-11 14:10:26,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:26,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:26,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 14:10:26,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:26,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:26,495 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-11 14:10:26,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:26,682 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-11 14:10:26,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:26,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-11 14:10:26,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:26,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:10:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:10:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:10:26,706 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-11 14:10:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:26,738 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-11 14:10:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:10:26,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-11 14:10:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:26,739 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:10:26,740 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 14:10:26,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:10:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 14:10:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 14:10:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:10:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-11 14:10:26,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-11 14:10:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:26,744 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-11 14:10:26,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:10:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-11 14:10:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 14:10:26,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:26,745 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-11 14:10:26,745 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-11 14:10:26,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:26,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,883 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-11 14:10:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:26,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:26,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,884 INFO 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-11 14:10:26,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:26,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:26,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:26,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:26,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:26,920 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-11 14:10:26,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:27,239 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-11 14:10:27,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:27,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-11 14:10:27,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:10:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:10:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:10:27,262 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-11 14:10:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:27,316 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-11 14:10:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:10:27,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-11 14:10:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:27,317 INFO L225 Difference]: With dead ends: 16 [2019-01-11 14:10:27,317 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 14:10:27,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:10:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 14:10:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-11 14:10:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 14:10:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-11 14:10:27,322 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-11 14:10:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:27,322 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-11 14:10:27,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:10:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-11 14:10:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 14:10:27,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:27,323 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-11 14:10:27,323 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-11 14:10:27,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:27,470 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-11 14:10:27,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:27,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:27,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:27,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:27,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:27,471 INFO 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-11 14:10:27,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:27,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:27,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:27,498 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-11 14:10:27,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:27,701 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-11 14:10:27,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:27,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-11 14:10:27,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:27,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:10:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:10:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:10:27,721 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-11 14:10:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:27,756 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-11 14:10:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 14:10:27,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-11 14:10:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:27,757 INFO L225 Difference]: With dead ends: 17 [2019-01-11 14:10:27,758 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 14:10:27,758 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-11 14:10:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 14:10:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-11 14:10:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 14:10:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-11 14:10:27,762 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-11 14:10:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:27,762 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-11 14:10:27,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:10:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-11 14:10:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 14:10:27,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:27,763 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-11 14:10:27,763 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:27,763 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-11 14:10:27,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:27,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:28,052 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-11 14:10:28,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:28,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:28,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:28,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:28,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:28,054 INFO 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-11 14:10:28,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:28,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:28,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-11 14:10:28,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:28,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:28,089 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-11 14:10:28,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:28,519 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-11 14:10:28,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:28,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-11 14:10:28,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:28,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:10:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:10:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-11 14:10:28,544 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-11 14:10:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:28,568 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-11 14:10:28,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 14:10:28,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-11 14:10:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:28,575 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:10:28,575 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 14:10:28,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-11 14:10:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 14:10:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-11 14:10:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 14:10:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-11 14:10:28,579 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-11 14:10:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:28,579 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-11 14:10:28,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:10:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-11 14:10:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 14:10:28,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:28,580 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-11 14:10:28,580 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-11 14:10:28,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:28,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:28,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:28,705 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-11 14:10:28,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:28,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:28,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:28,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:28,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:28,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:28,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:28,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:28,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:28,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:28,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:28,766 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-11 14:10:28,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:29,318 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-11 14:10:29,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:29,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-11 14:10:29,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:29,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 14:10:29,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 14:10:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 14:10:29,341 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-11 14:10:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:29,403 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-11 14:10:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 14:10:29,404 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-11 14:10:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:29,404 INFO L225 Difference]: With dead ends: 19 [2019-01-11 14:10:29,404 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:10:29,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 14:10:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:10:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 14:10:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:10:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-11 14:10:29,409 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-11 14:10:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:29,409 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-11 14:10:29,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 14:10:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-11 14:10:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 14:10:29,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:29,410 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-11 14:10:29,410 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-11 14:10:29,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:29,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:29,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:29,588 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-11 14:10:29,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:29,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:29,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:29,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:29,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:29,589 INFO 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-11 14:10:29,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:29,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:29,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:29,622 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-11 14:10:29,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:30,318 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-11 14:10:30,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:30,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-11 14:10:30,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:30,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 14:10:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 14:10:30,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 14:10:30,340 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-11 14:10:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:30,383 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-11 14:10:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 14:10:30,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-11 14:10:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:30,394 INFO L225 Difference]: With dead ends: 20 [2019-01-11 14:10:30,394 INFO L226 Difference]: Without dead ends: 18 [2019-01-11 14:10:30,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 14:10:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-11 14:10:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-11 14:10:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 14:10:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-11 14:10:30,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-11 14:10:30,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:30,401 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-11 14:10:30,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 14:10:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-11 14:10:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 14:10:30,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:30,403 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-11 14:10:30,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-11 14:10:30,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:30,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:30,773 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-11 14:10:30,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:30,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:30,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:30,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:30,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:30,774 INFO 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-11 14:10:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:30,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:30,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 14:10:30,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:30,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:30,813 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-11 14:10:30,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:31,247 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-11 14:10:31,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:31,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-11 14:10:31,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:31,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 14:10:31,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 14:10:31,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-11 14:10:31,268 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-11 14:10:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:31,302 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-11 14:10:31,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 14:10:31,303 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-11 14:10:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:31,304 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:10:31,304 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 14:10:31,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-11 14:10:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 14:10:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 14:10:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 14:10:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-11 14:10:31,309 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-11 14:10:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:31,309 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-11 14:10:31,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 14:10:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-11 14:10:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 14:10:31,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:31,310 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-11 14:10:31,311 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-11 14:10:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:31,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:31,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:31,548 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-11 14:10:31,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:31,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:31,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:31,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:31,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:31,549 INFO 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-11 14:10:31,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:31,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:31,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:31,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:31,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:31,589 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-11 14:10:31,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:32,145 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-11 14:10:32,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:32,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-11 14:10:32,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:32,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 14:10:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 14:10:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 14:10:32,167 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-11 14:10:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:32,289 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-11 14:10:32,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 14:10:32,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-11 14:10:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:32,291 INFO L225 Difference]: With dead ends: 22 [2019-01-11 14:10:32,291 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 14:10:32,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 14:10:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 14:10:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-11 14:10:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 14:10:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-11 14:10:32,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-11 14:10:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:32,296 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-11 14:10:32,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 14:10:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-11 14:10:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 14:10:32,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:32,297 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-11 14:10:32,297 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-11 14:10:32,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:32,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:32,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:32,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:32,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:32,990 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-11 14:10:32,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:32,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:32,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:32,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:32,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:32,991 INFO 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-11 14:10:33,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:33,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:33,038 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-11 14:10:33,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:33,724 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-11 14:10:33,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:33,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-11 14:10:33,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:33,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 14:10:33,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 14:10:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 14:10:33,744 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-11 14:10:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:33,771 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-11 14:10:33,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 14:10:33,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-11 14:10:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:33,772 INFO L225 Difference]: With dead ends: 23 [2019-01-11 14:10:33,772 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 14:10:33,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 14:10:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 14:10:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-11 14:10:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 14:10:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-11 14:10:33,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-11 14:10:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:33,776 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-11 14:10:33,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 14:10:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-11 14:10:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 14:10:33,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:33,777 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-11 14:10:33,777 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:33,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:33,777 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-11 14:10:33,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:33,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:33,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,963 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-11 14:10:33,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:33,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:33,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:33,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:33,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:33,964 INFO 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-11 14:10:33,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:33,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:33,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-11 14:10:33,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:34,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:34,007 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-11 14:10:34,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:34,981 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-11 14:10:35,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:35,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-11 14:10:35,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:35,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 14:10:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 14:10:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:35,003 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-11 14:10:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:35,036 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-11 14:10:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 14:10:35,039 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-11 14:10:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:35,040 INFO L225 Difference]: With dead ends: 24 [2019-01-11 14:10:35,040 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 14:10:35,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 14:10:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-11 14:10:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 14:10:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-11 14:10:35,045 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-11 14:10:35,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:35,046 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-11 14:10:35,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 14:10:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-11 14:10:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 14:10:35,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:35,048 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-11 14:10:35,048 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-11 14:10:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:35,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:35,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:35,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:35,898 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-11 14:10:35,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:35,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:35,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:35,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,899 INFO 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-11 14:10:35,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:35,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:35,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:35,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:35,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:35,940 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-11 14:10:35,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:36,351 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-11 14:10:36,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:36,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-11 14:10:36,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:36,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-11 14:10:36,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-11 14:10:36,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 14:10:36,373 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-11 14:10:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:36,413 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-11 14:10:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 14:10:36,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-11 14:10:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:36,414 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:10:36,414 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 14:10:36,416 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-11 14:10:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 14:10:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-11 14:10:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:10:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-11 14:10:36,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-11 14:10:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:36,419 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-11 14:10:36,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-11 14:10:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-11 14:10:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 14:10:36,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:36,420 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-11 14:10:36,420 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-11 14:10:36,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:36,743 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-11 14:10:36,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:36,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:36,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:36,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,743 INFO 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-11 14:10:36,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:36,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:36,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:36,794 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-11 14:10:36,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:37,278 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-11 14:10:37,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:37,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-11 14:10:37,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:37,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 14:10:37,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 14:10:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 14:10:37,299 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-11 14:10:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:37,341 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-11 14:10:37,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 14:10:37,343 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-11 14:10:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:37,344 INFO L225 Difference]: With dead ends: 26 [2019-01-11 14:10:37,344 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 14:10:37,345 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-11 14:10:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 14:10:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-11 14:10:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 14:10:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-11 14:10:37,348 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-11 14:10:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:37,348 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-11 14:10:37,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 14:10:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-11 14:10:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 14:10:37,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:37,349 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-11 14:10:37,350 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:37,350 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-11 14:10:37,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:38,041 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-11 14:10:38,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:38,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:38,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:38,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:38,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:38,042 INFO 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-11 14:10:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:38,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:38,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 14:10:38,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:38,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:38,091 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-11 14:10:38,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:38,678 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-11 14:10:38,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:38,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-11 14:10:38,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:38,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 14:10:38,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 14:10:38,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 14:10:38,700 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-11 14:10:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:38,742 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-11 14:10:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 14:10:38,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-11 14:10:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:38,744 INFO L225 Difference]: With dead ends: 27 [2019-01-11 14:10:38,745 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 14:10:38,746 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-11 14:10:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 14:10:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-11 14:10:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 14:10:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-11 14:10:38,749 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-11 14:10:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:38,749 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-11 14:10:38,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 14:10:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-11 14:10:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 14:10:38,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:38,750 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-11 14:10:38,750 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-11 14:10:38,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,102 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-11 14:10:39,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:39,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:39,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:39,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,103 INFO 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-11 14:10:39,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:39,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:39,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:39,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:39,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:39,142 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-11 14:10:39,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:39,850 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-11 14:10:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:39,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-11 14:10:39,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:39,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 14:10:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 14:10:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 14:10:39,872 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-11 14:10:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:39,943 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-11 14:10:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 14:10:39,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-11 14:10:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:39,946 INFO L225 Difference]: With dead ends: 28 [2019-01-11 14:10:39,946 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 14:10:39,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 14:10:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 14:10:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-11 14:10:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:10:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-11 14:10:39,950 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-11 14:10:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:39,950 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-11 14:10:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 14:10:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-11 14:10:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 14:10:39,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:39,952 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-11 14:10:39,952 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-11 14:10:39,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:40,422 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-11 14:10:40,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:40,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:40,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:40,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:40,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:40,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:40,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:40,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:40,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:40,459 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-11 14:10:40,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:41,153 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-11 14:10:41,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:41,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-11 14:10:41,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:41,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-11 14:10:41,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-11 14:10:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 14:10:41,176 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-11 14:10:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:41,244 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-11 14:10:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 14:10:41,244 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-11 14:10:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:41,244 INFO L225 Difference]: With dead ends: 29 [2019-01-11 14:10:41,244 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 14:10:41,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 14:10:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 14:10:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-11 14:10:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 14:10:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-11 14:10:41,249 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-11 14:10:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:41,249 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-11 14:10:41,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-11 14:10:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-11 14:10:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 14:10:41,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:41,250 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-11 14:10:41,250 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-11 14:10:41,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:42,335 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-11 14:10:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:42,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:42,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:42,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,336 INFO 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-11 14:10:42,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:42,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:42,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 14:10:42,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:42,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:42,401 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-11 14:10:42,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:43,138 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-11 14:10:43,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:43,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-11 14:10:43,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:43,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 14:10:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 14:10:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:43,158 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-11 14:10:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:43,210 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-11 14:10:43,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 14:10:43,210 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-11 14:10:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:43,211 INFO L225 Difference]: With dead ends: 30 [2019-01-11 14:10:43,211 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 14:10:43,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 14:10:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-11 14:10:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 14:10:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-11 14:10:43,216 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-11 14:10:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:43,217 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-11 14:10:43,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 14:10:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-11 14:10:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 14:10:43,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:43,217 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-11 14:10:43,218 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:43,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-11 14:10:43,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:43,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:43,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:43,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:43,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:43,688 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-11 14:10:43,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:43,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:43,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:43,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:43,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:43,689 INFO 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-11 14:10:43,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:43,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:43,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:43,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:43,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:43,734 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-11 14:10:43,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:44,472 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-11 14:10:44,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-11 14:10:44,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:44,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 14:10:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 14:10:44,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 14:10:44,495 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-11 14:10:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:44,551 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-11 14:10:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 14:10:44,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-11 14:10:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:44,552 INFO L225 Difference]: With dead ends: 31 [2019-01-11 14:10:44,552 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 14:10:44,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 14:10:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 14:10:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-11 14:10:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 14:10:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-11 14:10:44,557 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-11 14:10:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:44,558 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-11 14:10:44,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 14:10:44,558 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-11 14:10:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 14:10:44,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:44,559 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-11 14:10:44,559 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-11 14:10:44,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:44,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:44,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:44,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:44,940 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-11 14:10:44,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:44,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:44,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:44,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:44,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:44,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 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-11 14:10:44,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:44,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:44,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:44,982 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-11 14:10:44,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:46,952 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-11 14:10:46,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:46,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-11 14:10:46,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:46,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 14:10:46,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 14:10:46,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 14:10:46,973 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-11 14:10:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:47,061 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-11 14:10:47,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 14:10:47,062 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-11 14:10:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:47,063 INFO L225 Difference]: With dead ends: 32 [2019-01-11 14:10:47,063 INFO L226 Difference]: Without dead ends: 30 [2019-01-11 14:10:47,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 14:10:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-11 14:10:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-11 14:10:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 14:10:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-11 14:10:47,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-11 14:10:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:47,068 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-11 14:10:47,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 14:10:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-11 14:10:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 14:10:47,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:47,068 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-11 14:10:47,069 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-11 14:10:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:47,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:47,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:47,429 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-11 14:10:47,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:47,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:47,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:47,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:47,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:47,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-11 14:10:47,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:47,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:47,497 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-11 14:10:47,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:48,282 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-11 14:10:48,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:48,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-11 14:10:48,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 14:10:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 14:10:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 14:10:48,304 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-11 14:10:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:48,456 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-11 14:10:48,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 14:10:48,456 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-11 14:10:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:48,457 INFO L225 Difference]: With dead ends: 33 [2019-01-11 14:10:48,457 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 14:10:48,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 14:10:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 14:10:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 14:10:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:10:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-11 14:10:48,462 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-11 14:10:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:48,462 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-11 14:10:48,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 14:10:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-11 14:10:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 14:10:48,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:48,463 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-11 14:10:48,463 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-11 14:10:48,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:49,045 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-11 14:10:49,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:49,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:49,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:49,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:49,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:49,046 INFO 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-11 14:10:49,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:49,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:49,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:49,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:49,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:49,093 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-11 14:10:49,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:49,953 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-11 14:10:49,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:49,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-11 14:10:49,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:49,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 14:10:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 14:10:49,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 14:10:49,972 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-11 14:10:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:50,005 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-11 14:10:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 14:10:50,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-11 14:10:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:50,007 INFO L225 Difference]: With dead ends: 34 [2019-01-11 14:10:50,007 INFO L226 Difference]: Without dead ends: 32 [2019-01-11 14:10:50,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 14:10:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-11 14:10:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-11 14:10:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:10:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-11 14:10:50,012 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-11 14:10:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:50,012 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-11 14:10:50,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 14:10:50,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-11 14:10:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 14:10:50,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:50,013 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-11 14:10:50,013 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-11 14:10:50,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:50,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:50,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:50,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,891 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-11 14:10:50,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:50,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:50,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:50,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,892 INFO 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-11 14:10:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:50,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:50,939 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-11 14:10:50,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:51,916 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-11 14:10:51,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:51,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-11 14:10:51,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:51,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-11 14:10:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-11 14:10:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 14:10:51,936 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-11 14:10:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:52,021 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-11 14:10:52,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 14:10:52,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-11 14:10:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:52,022 INFO L225 Difference]: With dead ends: 35 [2019-01-11 14:10:52,022 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 14:10:52,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 14:10:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 14:10:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-11 14:10:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 14:10:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-11 14:10:52,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-11 14:10:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:52,028 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-11 14:10:52,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-11 14:10:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-11 14:10:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 14:10:52,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:52,031 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-11 14:10:52,031 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-11 14:10:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:52,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:52,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:52,474 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-11 14:10:52,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:52,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:52,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:52,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:52,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:52,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:52,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:52,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:52,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 14:10:52,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:52,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:52,558 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-11 14:10:52,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:53,585 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-11 14:10:53,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:53,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-11 14:10:53,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:53,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 14:10:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 14:10:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 14:10:53,606 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-11 14:10:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:53,658 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-11 14:10:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 14:10:53,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-11 14:10:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:53,660 INFO L225 Difference]: With dead ends: 36 [2019-01-11 14:10:53,660 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 14:10:53,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 14:10:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 14:10:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-11 14:10:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-11 14:10:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-11 14:10:53,663 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-11 14:10:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:53,663 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-11 14:10:53,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 14:10:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-11 14:10:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 14:10:53,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:53,664 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-11 14:10:53,664 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-11 14:10:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:53,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:54,139 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-11 14:10:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:54,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:54,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:54,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:54,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:54,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:54,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:54,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:54,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:54,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:54,192 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-11 14:10:54,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:55,274 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-11 14:10:55,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:55,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-11 14:10:55,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:55,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-11 14:10:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-11 14:10:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 14:10:55,294 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-11 14:10:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:55,388 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-11 14:10:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 14:10:55,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-11 14:10:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:55,389 INFO L225 Difference]: With dead ends: 37 [2019-01-11 14:10:55,389 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 14:10:55,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 14:10:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 14:10:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 14:10:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:10:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-11 14:10:55,393 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-11 14:10:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:55,394 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-11 14:10:55,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-11 14:10:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-11 14:10:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 14:10:55,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:55,394 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-11 14:10:55,394 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-11 14:10:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:55,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:55,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:56,124 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-11 14:10:56,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:56,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:56,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:56,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:56,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:56,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:56,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:56,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:56,169 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-11 14:10:56,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:57,244 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-11 14:10:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-11 14:10:57,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:57,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 14:10:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 14:10:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 14:10:57,266 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-11 14:10:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:57,332 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-11 14:10:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 14:10:57,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-11 14:10:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:57,333 INFO L225 Difference]: With dead ends: 38 [2019-01-11 14:10:57,333 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 14:10:57,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 14:10:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 14:10:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-11 14:10:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:10:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-11 14:10:57,337 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-11 14:10:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:57,338 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-11 14:10:57,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 14:10:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-11 14:10:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 14:10:57,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:57,339 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-11 14:10:57,339 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-11 14:10:57,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:58,046 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-11 14:10:58,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:58,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:58,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:58,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,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 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-11 14:10:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:58,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:58,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-11 14:10:58,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:58,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:58,146 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-11 14:10:58,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:59,305 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-11 14:10:59,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:59,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-11 14:10:59,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:59,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 14:10:59,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 14:10:59,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 14:10:59,325 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-11 14:10:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:59,392 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-11 14:10:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 14:10:59,392 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-11 14:10:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:59,393 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:10:59,393 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 14:10:59,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 14:10:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 14:10:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 14:10:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:10:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-11 14:10:59,397 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-11 14:10:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:59,397 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-11 14:10:59,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 14:10:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-11 14:10:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 14:10:59,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:59,398 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-11 14:10:59,398 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-11 14:10:59,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:59,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:59,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:59,970 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-11 14:10:59,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:59,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:59,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:59,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,971 INFO 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-11 14:10:59,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:59,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:00,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:00,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:00,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:00,031 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-11 14:11:00,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:01,567 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-11 14:11:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:01,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-11 14:11:01,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:01,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 14:11:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 14:11:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:01,588 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-11 14:11:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:01,693 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-11 14:11:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 14:11:01,694 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-11 14:11:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:01,694 INFO L225 Difference]: With dead ends: 40 [2019-01-11 14:11:01,694 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:11:01,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:11:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-11 14:11:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:11:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-11 14:11:01,699 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-11 14:11:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:01,699 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-11 14:11:01,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 14:11:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-11 14:11:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 14:11:01,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:01,700 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-11 14:11:01,700 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-11 14:11:01,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:01,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:01,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:02,784 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-11 14:11:02,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:02,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:02,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:02,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:02,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:02,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 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-11 14:11:02,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:02,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:02,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:02,844 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-11 14:11:02,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:04,178 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-11 14:11:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:04,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-11 14:11:04,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-11 14:11:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-11 14:11:04,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 14:11:04,199 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-11 14:11:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:04,265 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-11 14:11:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 14:11:04,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-11 14:11:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:04,267 INFO L225 Difference]: With dead ends: 41 [2019-01-11 14:11:04,267 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 14:11:04,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 14:11:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 14:11:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 14:11:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:11:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-11 14:11:04,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-11 14:11:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:04,271 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-11 14:11:04,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-11 14:11:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-11 14:11:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 14:11:04,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:04,272 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-11 14:11:04,272 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:04,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-11 14:11:04,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:04,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:04,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:04,989 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-11 14:11:04,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:04,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:04,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:04,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:04,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:04,991 INFO 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-11 14:11:04,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:04,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:05,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-11 14:11:05,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:05,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:05,105 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-11 14:11:05,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:06,538 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-11 14:11:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-11 14:11:06,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 14:11:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 14:11:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:11:06,558 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-11 14:11:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:06,608 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-11 14:11:06,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 14:11:06,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-11 14:11:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:06,609 INFO L225 Difference]: With dead ends: 42 [2019-01-11 14:11:06,609 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 14:11:06,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:11:06,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 14:11:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-11 14:11:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 14:11:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-11 14:11:06,613 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-11 14:11:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:06,613 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-11 14:11:06,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 14:11:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-11 14:11:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-11 14:11:06,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:06,614 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-11 14:11:06,614 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-11 14:11:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:06,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:06,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:06,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:06,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:07,575 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-11 14:11:07,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:07,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:07,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:07,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:07,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:07,576 INFO 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-11 14:11:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:07,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:07,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:07,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:07,627 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-11 14:11:07,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:09,132 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-11 14:11:09,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:09,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-11 14:11:09,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:09,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-11 14:11:09,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-11 14:11:09,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 14:11:09,152 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-11 14:11:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:09,218 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-11 14:11:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 14:11:09,218 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-11 14:11:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:09,219 INFO L225 Difference]: With dead ends: 43 [2019-01-11 14:11:09,219 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 14:11:09,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 14:11:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 14:11:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 14:11:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:11:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-11 14:11:09,222 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-11 14:11:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:09,223 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-11 14:11:09,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-11 14:11:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-11 14:11:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 14:11:09,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:09,224 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-11 14:11:09,224 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:09,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-11 14:11:09,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:09,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:09,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:09,838 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-11 14:11:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:09,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:09,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:09,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:09,839 INFO 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-11 14:11:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:09,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:09,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:09,889 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-11 14:11:09,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:11,850 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-11 14:11:11,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:11,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-11 14:11:11,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:11,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 14:11:11,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 14:11:11,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 14:11:11,869 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-11 14:11:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:11,953 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-11 14:11:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 14:11:11,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-11 14:11:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:11,955 INFO L225 Difference]: With dead ends: 44 [2019-01-11 14:11:11,955 INFO L226 Difference]: Without dead ends: 42 [2019-01-11 14:11:11,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 14:11:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-11 14:11:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-11 14:11:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 14:11:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-11 14:11:11,957 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-11 14:11:11,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:11,957 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-11 14:11:11,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 14:11:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-11 14:11:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 14:11:11,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:11,958 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-11 14:11:11,958 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-11 14:11:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:11,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:12,632 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-11 14:11:12,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:12,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:12,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:12,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:12,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:12,632 INFO 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-11 14:11:12,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:12,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:12,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 14:11:12,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:12,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:12,759 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-11 14:11:12,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:14,389 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-11 14:11:14,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:14,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-11 14:11:14,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:14,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 14:11:14,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 14:11:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:11:14,411 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-11 14:11:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:14,476 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-11 14:11:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 14:11:14,476 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-11 14:11:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:14,477 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:11:14,477 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 14:11:14,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:11:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 14:11:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-11 14:11:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 14:11:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-11 14:11:14,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-11 14:11:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:14,481 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-11 14:11:14,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 14:11:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-11 14:11:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 14:11:14,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:14,482 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-11 14:11:14,482 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:14,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-11 14:11:14,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:14,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:14,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:14,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:14,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:15,219 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-11 14:11:15,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:15,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:15,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:15,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:15,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:15,220 INFO 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-11 14:11:15,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:15,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:15,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:15,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:15,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:15,281 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-11 14:11:15,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:17,202 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-11 14:11:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:17,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-11 14:11:17,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:17,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 14:11:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 14:11:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 14:11:17,223 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-11 14:11:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:17,292 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-11 14:11:17,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 14:11:17,292 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-11 14:11:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:17,293 INFO L225 Difference]: With dead ends: 46 [2019-01-11 14:11:17,293 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:11:17,294 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-11 14:11:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:11:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-11 14:11:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-11 14:11:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-11 14:11:17,296 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-11 14:11:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:17,296 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-11 14:11:17,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 14:11:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-11 14:11:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 14:11:17,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:17,297 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-11 14:11:17,297 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-11 14:11:17,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:17,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:17,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:18,010 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-11 14:11:18,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:18,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:18,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:18,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:18,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:18,011 INFO 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-11 14:11:18,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:18,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:18,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:18,068 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-11 14:11:18,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:19,796 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-11 14:11:19,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-11 14:11:19,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:19,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-11 14:11:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-11 14:11:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-11 14:11:19,815 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-11 14:11:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:19,914 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-11 14:11:19,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 14:11:19,915 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-11 14:11:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:19,916 INFO L225 Difference]: With dead ends: 47 [2019-01-11 14:11:19,916 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 14:11:19,917 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-11 14:11:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 14:11:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-11 14:11:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 14:11:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-11 14:11:19,918 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-11 14:11:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:19,919 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-11 14:11:19,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-11 14:11:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-11 14:11:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 14:11:19,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:19,919 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-11 14:11:19,919 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-11 14:11:19,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:19,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:19,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:19,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:19,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:20,721 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-11 14:11:20,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:20,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:20,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:20,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:20,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:20,722 INFO 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-11 14:11:20,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:20,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:20,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 14:11:20,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:20,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:20,879 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-11 14:11:20,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:22,940 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-11 14:11:22,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:22,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-11 14:11:22,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:22,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 14:11:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 14:11:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:11:22,960 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-11 14:11:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:23,035 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-11 14:11:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 14:11:23,036 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-11 14:11:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:23,036 INFO L225 Difference]: With dead ends: 48 [2019-01-11 14:11:23,036 INFO L226 Difference]: Without dead ends: 46 [2019-01-11 14:11:23,037 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-11 14:11:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-11 14:11:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-11 14:11:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 14:11:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-11 14:11:23,039 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-11 14:11:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:23,039 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-11 14:11:23,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 14:11:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-11 14:11:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 14:11:23,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:23,040 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-11 14:11:23,040 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:23,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:23,040 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-11 14:11:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:23,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:23,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:23,758 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-11 14:11:23,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:23,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:23,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:23,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:23,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:23,759 INFO 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-11 14:11:23,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:23,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:23,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:23,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:23,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:23,817 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-11 14:11:23,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:25,776 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-11 14:11:25,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:25,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-11 14:11:25,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:25,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-11 14:11:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-11 14:11:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 14:11:25,795 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-11 14:11:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:25,845 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-11 14:11:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 14:11:25,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-11 14:11:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:25,847 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:11:25,847 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 14:11:25,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 14:11:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 14:11:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-11 14:11:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:11:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-11 14:11:25,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-11 14:11:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:25,850 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-11 14:11:25,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-11 14:11:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-11 14:11:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 14:11:25,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:25,851 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-11 14:11:25,851 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:25,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-11 14:11:25,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:25,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:25,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:25,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:25,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:27,033 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-11 14:11:27,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:27,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:27,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:27,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:27,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:27,034 INFO 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-11 14:11:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:27,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:27,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:27,095 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-11 14:11:27,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:29,175 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-11 14:11:29,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:29,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-11 14:11:29,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:29,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 14:11:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 14:11:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 14:11:29,196 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-11 14:11:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:29,292 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-11 14:11:29,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 14:11:29,292 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-11 14:11:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:29,293 INFO L225 Difference]: With dead ends: 50 [2019-01-11 14:11:29,293 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 14:11:29,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 14:11:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 14:11:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-11 14:11:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 14:11:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-11 14:11:29,296 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-11 14:11:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:29,296 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-11 14:11:29,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 14:11:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-11 14:11:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-11 14:11:29,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:29,297 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-11 14:11:29,297 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-11 14:11:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:29,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:30,100 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-11 14:11:30,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:30,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:30,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:30,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:30,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:30,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:30,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:30,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:30,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-11 14:11:30,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:30,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:30,267 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-11 14:11:30,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:32,572 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-11 14:11:32,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:32,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-11 14:11:32,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:32,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 14:11:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 14:11:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:11:32,592 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-11 14:11:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:32,648 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-11 14:11:32,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 14:11:32,648 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-11 14:11:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:32,649 INFO L225 Difference]: With dead ends: 51 [2019-01-11 14:11:32,649 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 14:11:32,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:11:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 14:11:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-11 14:11:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 14:11:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-11 14:11:32,652 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-11 14:11:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:32,653 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-11 14:11:32,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 14:11:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-11 14:11:32,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 14:11:32,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:32,654 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-11 14:11:32,654 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:32,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:32,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-11 14:11:32,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:32,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:32,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:32,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:32,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:33,499 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-11 14:11:33,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:33,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:33,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:33,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:33,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:33,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 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-11 14:11:33,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:33,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:33,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:33,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:33,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:33,566 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-11 14:11:33,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:35,785 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-11 14:11:35,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:35,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-11 14:11:35,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:35,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 14:11:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 14:11:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:11:35,805 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-11 14:11:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:36,229 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-11 14:11:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 14:11:36,229 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-11 14:11:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:36,230 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:11:36,230 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 14:11:36,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:11:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 14:11:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-11 14:11:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-11 14:11:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-11 14:11:36,232 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-11 14:11:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:36,232 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-11 14:11:36,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 14:11:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-11 14:11:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-11 14:11:36,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:36,233 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-11 14:11:36,234 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-11 14:11:36,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:36,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:36,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:36,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:37,545 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-11 14:11:37,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:37,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:37,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:37,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:11:37,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:37,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:37,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:37,609 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-11 14:11:37,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:39,918 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-11 14:11:39,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:39,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-11 14:11:39,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:39,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-11 14:11:39,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-11 14:11:39,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 14:11:39,939 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-11 14:11:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:40,032 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-11 14:11:40,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 14:11:40,032 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-11 14:11:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:40,033 INFO L225 Difference]: With dead ends: 53 [2019-01-11 14:11:40,033 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 14:11:40,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 14:11:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 14:11:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-11 14:11:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:11:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-11 14:11:40,037 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-11 14:11:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:40,038 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-11 14:11:40,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-11 14:11:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-11 14:11:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 14:11:40,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:40,039 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-11 14:11:40,039 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-11 14:11:40,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:40,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:40,990 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-11 14:11:40,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:40,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:40,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:40,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:40,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:40,991 INFO 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-11 14:11:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:41,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:41,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 14:11:41,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:41,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:41,197 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-11 14:11:41,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:43,781 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-11 14:11:43,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:43,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-11 14:11:43,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:43,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 14:11:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 14:11:43,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 14:11:43,801 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-11 14:11:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:43,860 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-11 14:11:43,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 14:11:43,861 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-11 14:11:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:43,862 INFO L225 Difference]: With dead ends: 54 [2019-01-11 14:11:43,862 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 14:11:43,863 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-11 14:11:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 14:11:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-11 14:11:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 14:11:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-11 14:11:43,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-11 14:11:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:43,866 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-11 14:11:43,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 14:11:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-11 14:11:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 14:11:43,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:43,867 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-11 14:11:43,867 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-11 14:11:43,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:43,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:43,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:44,883 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-11 14:11:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:44,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:44,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:44,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:44,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:44,884 INFO 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-11 14:11:44,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:44,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:44,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:44,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:44,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:44,956 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-11 14:11:44,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:47,648 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-11 14:11:47,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:47,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-11 14:11:47,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:47,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-11 14:11:47,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-11 14:11:47,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 14:11:47,677 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-11 14:11:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:47,819 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-11 14:11:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 14:11:47,819 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-11 14:11:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:47,820 INFO L225 Difference]: With dead ends: 55 [2019-01-11 14:11:47,820 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 14:11:47,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 14:11:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 14:11:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 14:11:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 14:11:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-11 14:11:47,825 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-11 14:11:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:47,825 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-11 14:11:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-11 14:11:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-11 14:11:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 14:11:47,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:47,826 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-11 14:11:47,826 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-11 14:11:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:47,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:47,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:48,865 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-11 14:11:48,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:48,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:48,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:48,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:48,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:48,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:11:48,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:48,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:48,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:48,927 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-11 14:11:48,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:51,709 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-11 14:11:51,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:51,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-11 14:11:51,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:51,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 14:11:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 14:11:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 14:11:51,730 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-11 14:11:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:51,794 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-11 14:11:51,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 14:11:51,795 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-11 14:11:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:51,796 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:11:51,796 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 14:11:51,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 14:11:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 14:11:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-11 14:11:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 14:11:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-11 14:11:51,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-11 14:11:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:51,799 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-11 14:11:51,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 14:11:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-11 14:11:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-11 14:11:51,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:51,800 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-11 14:11:51,800 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:51,800 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-11 14:11:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:51,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:53,003 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-11 14:11:53,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:53,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:53,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:53,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:53,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:53,004 INFO 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-11 14:11:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:53,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:53,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-11 14:11:53,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:53,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:53,250 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-11 14:11:53,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:55,978 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-11 14:11:56,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:56,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-11 14:11:56,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:56,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 14:11:56,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 14:11:56,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 14:11:56,008 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-11 14:11:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:56,184 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-11 14:11:56,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 14:11:56,184 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-11 14:11:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:56,185 INFO L225 Difference]: With dead ends: 57 [2019-01-11 14:11:56,185 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:11:56,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 14:11:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:11:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-11 14:11:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 14:11:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-11 14:11:56,188 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-11 14:11:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:56,188 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-11 14:11:56,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 14:11:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-11 14:11:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 14:11:56,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:56,189 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-11 14:11:56,189 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:56,189 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-11 14:11:56,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:56,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:56,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:57,713 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-11 14:11:57,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:57,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:57,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:57,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:57,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:57,714 INFO 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-11 14:11:57,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:57,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:57,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:57,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:57,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:57,784 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-11 14:11:57,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:00,635 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-11 14:12:00,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:00,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-11 14:12:00,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:00,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 14:12:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 14:12:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 14:12:00,655 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-11 14:12:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:00,749 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-11 14:12:00,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 14:12:00,750 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-11 14:12:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:00,751 INFO L225 Difference]: With dead ends: 58 [2019-01-11 14:12:00,751 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 14:12:00,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 14:12:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 14:12:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-11 14:12:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 14:12:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-11 14:12:00,753 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-11 14:12:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:00,754 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-11 14:12:00,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 14:12:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-11 14:12:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 14:12:00,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:00,754 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-11 14:12:00,755 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-11 14:12:00,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:00,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:00,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:01,828 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-11 14:12:01,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:01,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:01,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:01,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:01,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:01,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:12:01,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:01,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:01,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:01,895 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-11 14:12:01,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:04,998 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-11 14:12:05,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:05,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-11 14:12:05,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:05,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 14:12:05,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 14:12:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 14:12:05,019 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-11 14:12:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:05,114 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-11 14:12:05,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 14:12:05,114 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-11 14:12:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:05,115 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:12:05,115 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 14:12:05,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 14:12:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 14:12:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-11 14:12:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 14:12:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-11 14:12:05,118 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-11 14:12:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:05,118 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-11 14:12:05,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 14:12:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-11 14:12:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 14:12:05,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:05,119 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-11 14:12:05,119 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:05,120 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-11 14:12:05,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:05,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:05,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:05,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:05,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:06,205 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-11 14:12:06,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:06,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:06,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:06,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:06,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:06,205 INFO 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-11 14:12:06,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:06,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:06,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-11 14:12:06,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:06,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:06,489 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-11 14:12:06,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:09,784 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-11 14:12:09,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:09,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-11 14:12:09,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:09,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 14:12:09,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 14:12:09,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 14:12:09,807 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-11 14:12:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:09,874 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-11 14:12:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 14:12:09,875 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-11 14:12:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:09,876 INFO L225 Difference]: With dead ends: 60 [2019-01-11 14:12:09,876 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 14:12:09,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 14:12:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 14:12:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-11 14:12:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 14:12:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-11 14:12:09,878 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-11 14:12:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:09,879 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-11 14:12:09,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 14:12:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-11 14:12:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-11 14:12:09,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:09,879 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-11 14:12:09,879 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-11 14:12:09,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:09,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:09,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:09,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:09,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:11,131 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-11 14:12:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:11,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:11,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:11,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:11,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:11,132 INFO 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-11 14:12:11,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:11,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:11,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:11,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:11,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:11,202 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-11 14:12:11,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:14,531 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-11 14:12:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:14,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-11 14:12:14,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:14,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-11 14:12:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-11 14:12:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 14:12:14,551 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-11 14:12:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:14,644 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-11 14:12:14,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 14:12:14,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-11 14:12:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:14,646 INFO L225 Difference]: With dead ends: 61 [2019-01-11 14:12:14,646 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 14:12:14,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-11 14:12:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 14:12:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-11 14:12:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 14:12:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-11 14:12:14,648 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-11 14:12:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:14,648 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-11 14:12:14,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-11 14:12:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-11 14:12:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 14:12:14,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:14,649 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-11 14:12:14,649 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-11 14:12:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:14,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:14,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:16,027 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-11 14:12:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:16,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:16,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:16,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:16,027 INFO 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-11 14:12:16,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:16,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:16,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:16,099 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-11 14:12:16,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:19,613 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-11 14:12:19,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:19,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-11 14:12:19,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:19,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 14:12:19,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 14:12:19,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 14:12:19,633 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-11 14:12:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:19,746 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-11 14:12:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 14:12:19,746 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-11 14:12:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:19,747 INFO L225 Difference]: With dead ends: 62 [2019-01-11 14:12:19,747 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 14:12:19,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 14:12:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 14:12:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-11 14:12:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 14:12:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-11 14:12:19,751 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-11 14:12:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:19,751 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-11 14:12:19,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 14:12:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-11 14:12:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-11 14:12:19,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:19,752 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-11 14:12:19,752 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-11 14:12:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:19,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:19,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:21,588 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-11 14:12:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:21,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:21,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:21,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:21,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:21,589 INFO 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-11 14:12:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:21,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:21,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-11 14:12:21,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:21,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:21,902 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-11 14:12:21,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:25,566 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-11 14:12:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-11 14:12:25,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:25,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 14:12:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 14:12:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 14:12:25,587 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-11 14:12:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:25,662 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-11 14:12:25,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 14:12:25,663 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-11 14:12:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:25,663 INFO L225 Difference]: With dead ends: 63 [2019-01-11 14:12:25,666 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 14:12:25,666 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-11 14:12:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 14:12:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-11 14:12:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:12:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-11 14:12:25,668 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-11 14:12:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:25,669 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-11 14:12:25,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 14:12:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-11 14:12:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 14:12:25,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:25,669 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-11 14:12:25,670 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:25,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:25,670 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-11 14:12:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:25,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:25,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:27,027 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-11 14:12:27,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:27,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:27,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:27,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:27,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:27,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 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-11 14:12:27,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:27,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:27,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:27,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:27,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:27,103 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-11 14:12:27,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:31,221 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-11 14:12:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:31,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-11 14:12:31,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:31,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 14:12:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 14:12:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 14:12:31,241 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-11 14:12:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:31,353 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-11 14:12:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 14:12:31,354 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-11 14:12:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:31,355 INFO L225 Difference]: With dead ends: 64 [2019-01-11 14:12:31,355 INFO L226 Difference]: Without dead ends: 62 [2019-01-11 14:12:31,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 14:12:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-11 14:12:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-11 14:12:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 14:12:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-11 14:12:31,358 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-11 14:12:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:31,358 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-11 14:12:31,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 14:12:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-11 14:12:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-11 14:12:31,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:31,359 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-11 14:12:31,359 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-11 14:12:31,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:31,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:31,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:32,686 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-11 14:12:32,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:32,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:32,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:32,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:32,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:32,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 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-11 14:12:32,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:32,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:32,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:32,778 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-11 14:12:32,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:36,585 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-11 14:12:36,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:36,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-11 14:12:36,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:36,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-11 14:12:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-11 14:12:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 14:12:36,605 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-11 14:12:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:36,698 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-11 14:12:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 14:12:36,699 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-11 14:12:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:36,700 INFO L225 Difference]: With dead ends: 65 [2019-01-11 14:12:36,700 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 14:12:36,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 14:12:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 14:12:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 14:12:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 14:12:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-11 14:12:36,705 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-11 14:12:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:36,705 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-11 14:12:36,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-11 14:12:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-11 14:12:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 14:12:36,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:36,706 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-11 14:12:36,706 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:36,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-11 14:12:36,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:36,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:36,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:36,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:36,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:38,535 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-11 14:12:38,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:38,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:38,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:38,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:38,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:38,536 INFO 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-11 14:12:38,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:38,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:38,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-11 14:12:38,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:38,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:38,904 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-11 14:12:38,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:42,627 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-11 14:12:42,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-11 14:12:42,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 14:12:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 14:12:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 14:12:42,649 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-11 14:12:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:42,723 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-11 14:12:42,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 14:12:42,724 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-11 14:12:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:42,725 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:12:42,725 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 14:12:42,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 14:12:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 14:12:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-11 14:12:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 14:12:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-11 14:12:42,728 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-11 14:12:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:42,729 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-11 14:12:42,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 14:12:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-11 14:12:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-11 14:12:42,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:42,729 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-11 14:12:42,729 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-11 14:12:42,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:42,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:42,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:44,457 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-11 14:12:44,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:44,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:44,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:44,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:44,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:44,458 INFO 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-11 14:12:44,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:44,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:44,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:44,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:44,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:44,531 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-11 14:12:44,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:48,592 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-11 14:12:48,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:48,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-11 14:12:48,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:48,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-11 14:12:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-11 14:12:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 14:12:48,613 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-11 14:12:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:48,743 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-11 14:12:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 14:12:48,744 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-11 14:12:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:48,744 INFO L225 Difference]: With dead ends: 67 [2019-01-11 14:12:48,744 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 14:12:48,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-11 14:12:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 14:12:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 14:12:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 14:12:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-11 14:12:48,747 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-11 14:12:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:48,747 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-11 14:12:48,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-11 14:12:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-11 14:12:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 14:12:48,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:48,748 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-11 14:12:48,748 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-11 14:12:48,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:48,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:48,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:48,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:50,093 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-11 14:12:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:50,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:50,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:50,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:50,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:50,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:12:50,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:50,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:50,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:50,173 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-11 14:12:50,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:54,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:54,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-11 14:12:54,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:54,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 14:12:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 14:12:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 14:12:54,427 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-11 14:12:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:54,570 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-11 14:12:54,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 14:12:54,570 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-11 14:12:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:54,571 INFO L225 Difference]: With dead ends: 68 [2019-01-11 14:12:54,571 INFO L226 Difference]: Without dead ends: 66 [2019-01-11 14:12:54,572 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-11 14:12:54,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-11 14:12:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-11 14:12:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 14:12:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-11 14:12:54,573 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-11 14:12:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:54,574 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-11 14:12:54,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 14:12:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-11 14:12:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 14:12:54,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:54,574 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-11 14:12:54,574 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-11 14:12:54,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:54,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:54,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:56,017 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-11 14:12:56,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:56,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:56,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:56,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:56,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:56,018 INFO 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-11 14:12:56,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:56,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:56,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-11 14:12:56,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:56,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:56,441 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-11 14:12:56,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:00,727 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-11 14:13:00,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:00,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-11 14:13:00,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:00,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 14:13:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 14:13:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 14:13:00,750 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-11 14:13:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:00,868 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-11 14:13:00,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 14:13:00,869 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-11 14:13:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:00,869 INFO L225 Difference]: With dead ends: 69 [2019-01-11 14:13:00,869 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 14:13:00,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 14:13:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 14:13:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 14:13:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 14:13:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-11 14:13:00,874 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-11 14:13:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:00,875 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-11 14:13:00,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 14:13:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-11 14:13:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 14:13:00,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:00,876 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-11 14:13:00,876 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-11 14:13:00,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:00,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:00,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:00,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:00,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:02,392 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-11 14:13:02,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:02,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:02,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:02,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:02,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:02,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:13:02,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:02,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:02,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:02,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:02,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:02,500 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-11 14:13:02,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:06,939 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-11 14:13:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-11 14:13:06,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:06,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 14:13:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 14:13:06,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 14:13:06,961 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-11 14:13:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:07,077 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-11 14:13:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 14:13:07,080 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-11 14:13:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:07,081 INFO L225 Difference]: With dead ends: 70 [2019-01-11 14:13:07,081 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 14:13:07,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 14:13:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 14:13:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-11 14:13:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 14:13:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-11 14:13:07,085 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-11 14:13:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:07,086 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-11 14:13:07,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 14:13:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-11 14:13:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-11 14:13:07,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:07,086 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-11 14:13:07,087 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-11 14:13:07,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:07,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:07,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:08,846 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-11 14:13:08,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:08,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:08,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:08,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:08,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:08,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 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-11 14:13:08,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:08,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:08,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:08,923 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-11 14:13:08,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:13,202 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-11 14:13:13,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:13,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-11 14:13:13,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:13,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-11 14:13:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-11 14:13:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-11 14:13:13,223 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-11 14:13:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:13,313 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-11 14:13:13,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 14:13:13,313 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-11 14:13:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:13,314 INFO L225 Difference]: With dead ends: 71 [2019-01-11 14:13:13,314 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 14:13:13,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-11 14:13:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 14:13:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-11 14:13:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 14:13:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-11 14:13:13,318 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-11 14:13:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:13,318 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-11 14:13:13,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-11 14:13:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-11 14:13:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 14:13:13,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:13,319 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-11 14:13:13,319 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-11 14:13:13,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:13,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:13,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:15,824 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-11 14:13:15,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:15,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:15,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:15,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:15,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:15,825 INFO 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-11 14:13:15,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:13:15,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:13:16,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-11 14:13:16,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:16,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:16,312 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-11 14:13:16,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:21,098 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-11 14:13:21,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:21,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-11 14:13:21,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:21,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 14:13:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 14:13:21,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 14:13:21,120 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-11 14:13:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:21,224 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-11 14:13:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 14:13:21,225 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-11 14:13:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:21,225 INFO L225 Difference]: With dead ends: 72 [2019-01-11 14:13:21,225 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 14:13:21,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 14:13:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 14:13:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-11 14:13:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-11 14:13:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-11 14:13:21,228 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-11 14:13:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:21,228 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-11 14:13:21,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 14:13:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-11 14:13:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-11 14:13:21,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:21,229 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-11 14:13:21,229 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-11 14:13:21,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:21,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:21,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:22,779 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-11 14:13:22,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:22,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:22,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:22,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:22,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:22,779 INFO 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-11 14:13:22,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:22,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:22,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:22,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:22,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:22,869 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-11 14:13:22,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:28,816 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-11 14:13:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:28,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-11 14:13:28,834 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:28,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-11 14:13:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-11 14:13:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 14:13:28,836 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-11 14:13:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:29,114 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-11 14:13:29,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 14:13:29,115 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-11 14:13:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:29,115 INFO L225 Difference]: With dead ends: 73 [2019-01-11 14:13:29,115 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 14:13:29,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-11 14:13:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 14:13:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-11 14:13:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:13:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-11 14:13:29,118 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-11 14:13:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:29,118 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-11 14:13:29,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-11 14:13:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-11 14:13:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 14:13:29,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:29,119 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-11 14:13:29,119 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-11 14:13:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:29,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:29,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:31,009 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-11 14:13:31,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:31,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:31,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:31,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:31,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:31,010 INFO 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-11 14:13:31,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:31,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:31,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:31,110 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-11 14:13:31,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:36,177 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-11 14:13:36,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:36,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-11 14:13:36,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:36,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 14:13:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 14:13:36,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 14:13:36,199 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-11 14:13:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:36,296 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-11 14:13:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 14:13:36,296 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-11 14:13:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:36,297 INFO L225 Difference]: With dead ends: 74 [2019-01-11 14:13:36,297 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 14:13:36,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 14:13:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 14:13:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-11 14:13:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 14:13:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-11 14:13:36,301 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-11 14:13:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:36,301 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-11 14:13:36,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 14:13:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-11 14:13:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 14:13:36,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:36,302 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-11 14:13:36,302 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:36,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:36,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-11 14:13:36,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:36,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:36,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:38,039 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-11 14:13:38,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:38,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:38,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:38,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:38,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:38,039 INFO 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-11 14:13:38,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:13:38,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:13:38,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-11 14:13:38,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:38,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:38,606 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-11 14:13:38,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:43,653 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-11 14:13:43,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:43,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-11 14:13:43,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:43,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 14:13:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 14:13:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 14:13:43,674 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-11 14:13:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:43,875 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-11 14:13:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 14:13:43,875 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-11 14:13:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:43,876 INFO L225 Difference]: With dead ends: 75 [2019-01-11 14:13:43,876 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 14:13:43,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 14:13:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 14:13:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-11 14:13:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 14:13:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-11 14:13:43,878 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-11 14:13:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:43,878 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-11 14:13:43,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 14:13:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-11 14:13:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 14:13:43,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:43,879 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-11 14:13:43,879 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-11 14:13:43,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:43,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:43,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:45,812 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-11 14:13:45,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:45,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:45,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:45,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:45,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:45,813 INFO 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-11 14:13:45,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:45,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:45,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:45,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:45,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:45,894 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-11 14:13:45,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:51,764 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-11 14:13:51,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:51,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-11 14:13:51,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:51,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 14:13:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 14:13:51,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 14:13:51,785 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-11 14:13:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:51,936 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-11 14:13:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 14:13:51,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-11 14:13:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:51,938 INFO L225 Difference]: With dead ends: 76 [2019-01-11 14:13:51,938 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 14:13:51,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 14:13:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 14:13:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-11 14:13:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 14:13:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-11 14:13:51,942 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-11 14:13:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:51,942 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-11 14:13:51,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 14:13:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-11 14:13:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-11 14:13:51,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:51,943 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-11 14:13:51,943 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-11 14:13:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:51,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:51,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:53,757 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-11 14:13:53,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:53,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:53,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:53,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:53,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:53,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:13:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:53,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:53,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:53,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:59,352 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-11 14:13:59,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:59,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-11 14:13:59,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:59,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-11 14:13:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-11 14:13:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-11 14:13:59,373 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-11 14:13:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:59,590 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-11 14:13:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 14:13:59,591 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-11 14:13:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:59,591 INFO L225 Difference]: With dead ends: 77 [2019-01-11 14:13:59,592 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 14:13:59,592 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-11 14:13:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 14:13:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-11 14:13:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 14:13:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-11 14:13:59,595 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-11 14:13:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:59,595 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-11 14:13:59,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-11 14:13:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-11 14:13:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 14:13:59,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:59,596 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-11 14:13:59,596 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:13:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-11 14:13:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:59,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:59,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:01,675 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-11 14:14:01,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:01,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:01,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:01,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:01,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:01,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 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-11 14:14:01,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:01,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:02,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-11 14:14:02,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:02,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:02,364 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-11 14:14:02,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:07,674 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-11 14:14:07,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:07,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-11 14:14:07,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:07,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 14:14:07,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 14:14:07,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 14:14:07,696 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-11 14:14:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:07,841 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-11 14:14:07,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 14:14:07,841 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-11 14:14:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:07,842 INFO L225 Difference]: With dead ends: 78 [2019-01-11 14:14:07,842 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 14:14:07,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 14:14:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 14:14:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-11 14:14:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 14:14:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-11 14:14:07,846 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-11 14:14:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:07,846 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-11 14:14:07,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 14:14:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-11 14:14:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 14:14:07,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:07,847 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-11 14:14:07,847 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-11 14:14:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:07,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:07,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:09,795 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-11 14:14:09,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:09,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:09,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:09,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:09,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:09,796 INFO 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-11 14:14:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:14:09,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:14:09,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:14:09,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:09,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:09,889 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-11 14:14:09,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:15,960 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-11 14:14:15,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-11 14:14:15,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:15,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-11 14:14:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-11 14:14:15,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 14:14:15,980 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-11 14:14:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:16,129 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-11 14:14:16,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 14:14:16,130 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-11 14:14:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:16,130 INFO L225 Difference]: With dead ends: 79 [2019-01-11 14:14:16,130 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 14:14:16,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-11 14:14:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 14:14:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 14:14:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:14:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-11 14:14:16,134 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-11 14:14:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:16,134 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-11 14:14:16,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-11 14:14:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-11 14:14:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 14:14:16,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:16,135 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-11 14:14:16,135 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-11 14:14:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:16,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:16,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:18,403 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-11 14:14:18,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:18,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:18,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:18,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:18,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:18,403 INFO 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-11 14:14:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:18,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:14:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:18,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:18,495 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-11 14:14:18,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:24,251 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-11 14:14:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:24,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-11 14:14:24,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:24,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 14:14:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 14:14:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 14:14:24,271 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-11 14:14:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:24,423 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-11 14:14:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 14:14:24,424 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-11 14:14:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:24,424 INFO L225 Difference]: With dead ends: 80 [2019-01-11 14:14:24,424 INFO L226 Difference]: Without dead ends: 78 [2019-01-11 14:14:24,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 14:14:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-11 14:14:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-11 14:14:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 14:14:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-11 14:14:24,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-11 14:14:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:24,428 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-11 14:14:24,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 14:14:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-11 14:14:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-11 14:14:24,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:24,429 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-11 14:14:24,429 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-11 14:14:24,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:24,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:24,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:24,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:26,633 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-11 14:14:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:26,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:26,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:26,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:26,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:14:26,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:26,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:27,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-11 14:14:27,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:27,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:27,328 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-11 14:14:27,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:33,278 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-11 14:14:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:33,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-11 14:14:33,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:33,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 14:14:33,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 14:14:33,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 14:14:33,301 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-11 14:14:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:33,411 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-11 14:14:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 14:14:33,412 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-11 14:14:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:33,412 INFO L225 Difference]: With dead ends: 81 [2019-01-11 14:14:33,412 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 14:14:33,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 14:14:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 14:14:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 14:14:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 14:14:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-11 14:14:33,416 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-11 14:14:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:33,417 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-11 14:14:33,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 14:14:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-11 14:14:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 14:14:33,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:33,417 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-11 14:14:33,418 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-11 14:14:33,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:33,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:33,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:33,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:33,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:35,520 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-11 14:14:35,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:35,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:35,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:35,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:35,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:35,521 INFO 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-11 14:14:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:14:35,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:14:35,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:14:35,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:35,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:35,615 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-11 14:14:35,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:41,820 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-11 14:14:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:41,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-11 14:14:41,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:41,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 14:14:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 14:14:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 14:14:41,840 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-11 14:14:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:41,950 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-11 14:14:41,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 14:14:41,966 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-11 14:14:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:41,967 INFO L225 Difference]: With dead ends: 82 [2019-01-11 14:14:41,967 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 14:14:41,967 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-11 14:14:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 14:14:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-11 14:14:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 14:14:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-11 14:14:41,969 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-11 14:14:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:41,970 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-11 14:14:41,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 14:14:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-11 14:14:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 14:14:41,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:41,971 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-11 14:14:41,971 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-11 14:14:41,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:41,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:41,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:41,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:44,081 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-11 14:14:44,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:44,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:44,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:44,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:44,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:44,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:14:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:44,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:14:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:44,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:44,184 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-11 14:14:44,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:50,409 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-11 14:14:50,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:50,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-11 14:14:50,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:50,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-11 14:14:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-11 14:14:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 14:14:50,429 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-11 14:14:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:51,421 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-11 14:14:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 14:14:51,421 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-11 14:14:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:51,422 INFO L225 Difference]: With dead ends: 83 [2019-01-11 14:14:51,422 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 14:14:51,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 14:14:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 14:14:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 14:14:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 14:14:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-11 14:14:51,424 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-11 14:14:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-11 14:14:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-11 14:14:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-11 14:14:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 14:14:51,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:51,425 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-11 14:14:51,425 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:14:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-11 14:14:51,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:51,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:51,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:51,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:53,517 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-11 14:14:53,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:53,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:53,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:53,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:53,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:53,517 INFO 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-11 14:14:53,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:53,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:54,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-11 14:14:54,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:54,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:54,368 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-11 14:14:54,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:00,804 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-11 14:15:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-11 14:15:00,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:00,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 14:15:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 14:15:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 14:15:00,826 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-11 14:15:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:01,491 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-11 14:15:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 14:15:01,492 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-11 14:15:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:01,492 INFO L225 Difference]: With dead ends: 84 [2019-01-11 14:15:01,493 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 14:15:01,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 14:15:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 14:15:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-11 14:15:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-11 14:15:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-11 14:15:01,496 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-11 14:15:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:01,496 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-11 14:15:01,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 14:15:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-11 14:15:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-11 14:15:01,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:01,497 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-11 14:15:01,497 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-11 14:15:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:01,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:01,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:03,973 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-11 14:15:03,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:03,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:03,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:03,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:03,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:03,974 INFO 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-11 14:15:03,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:03,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:04,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:04,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:04,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:04,085 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-11 14:15:04,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:10,807 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-11 14:15:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-11 14:15:10,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:10,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-11 14:15:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-11 14:15:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 14:15:10,828 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-11 14:15:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:10,982 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-11 14:15:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 14:15:10,982 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-11 14:15:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:10,983 INFO L225 Difference]: With dead ends: 85 [2019-01-11 14:15:10,983 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 14:15:10,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 14:15:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 14:15:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-11 14:15:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 14:15:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-11 14:15:10,986 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-11 14:15:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:10,987 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-11 14:15:10,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-11 14:15:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-11 14:15:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 14:15:10,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:10,988 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-11 14:15:10,988 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-11 14:15:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:10,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:10,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:13,497 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-11 14:15:13,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:13,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:13,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:13,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:13,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:13,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:15:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:13,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:15:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:13,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:13,594 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-11 14:15:13,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:20,335 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-11 14:15:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:20,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-11 14:15:20,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:20,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 14:15:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 14:15:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 14:15:20,355 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-11 14:15:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:20,461 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-11 14:15:20,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 14:15:20,461 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-11 14:15:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:20,462 INFO L225 Difference]: With dead ends: 86 [2019-01-11 14:15:20,462 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 14:15:20,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 14:15:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 14:15:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-11 14:15:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 14:15:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-11 14:15:20,466 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-11 14:15:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:20,467 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-11 14:15:20,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 14:15:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-11 14:15:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 14:15:20,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:20,467 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-11 14:15:20,468 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-11 14:15:20,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:20,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:20,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:20,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:20,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:23,118 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-11 14:15:23,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:23,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:23,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:23,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:23,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:23,119 INFO 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-11 14:15:23,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:15:23,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:15:24,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-11 14:15:24,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:24,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:24,028 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-11 14:15:24,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:31,049 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-11 14:15:31,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:31,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-11 14:15:31,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:31,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 14:15:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 14:15:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 14:15:31,072 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-11 14:15:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:31,260 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-11 14:15:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 14:15:31,260 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-11 14:15:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:31,260 INFO L225 Difference]: With dead ends: 87 [2019-01-11 14:15:31,260 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 14:15:31,261 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-11 14:15:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 14:15:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-11 14:15:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 14:15:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-11 14:15:31,264 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-11 14:15:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:31,264 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-11 14:15:31,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 14:15:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-11 14:15:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 14:15:31,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:31,265 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-11 14:15:31,265 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-11 14:15:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:31,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:31,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:33,928 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-11 14:15:33,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:33,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:33,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:33,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:33,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:33,929 INFO 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-11 14:15:33,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:33,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:34,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:34,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:34,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:34,033 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-11 14:15:34,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:41,096 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-11 14:15:41,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:41,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-11 14:15:41,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:41,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 14:15:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 14:15:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 14:15:41,117 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-11 14:15:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:41,283 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-11 14:15:41,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 14:15:41,284 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-11 14:15:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:41,284 INFO L225 Difference]: With dead ends: 88 [2019-01-11 14:15:41,284 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 14:15:41,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 14:15:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 14:15:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-11 14:15:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-11 14:15:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-11 14:15:41,287 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-11 14:15:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:41,288 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-11 14:15:41,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 14:15:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-11 14:15:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 14:15:41,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:41,289 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-11 14:15:41,289 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-11 14:15:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:41,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:41,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:44,091 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-11 14:15:44,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:44,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:44,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:44,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:44,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:44,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 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-11 14:15:44,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:44,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:15:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:44,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:44,198 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-11 14:15:44,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:51,359 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-11 14:15:51,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:51,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-11 14:15:51,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:51,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-11 14:15:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-11 14:15:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 14:15:51,379 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-11 14:15:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:51,521 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-11 14:15:51,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 14:15:51,522 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-11 14:15:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:51,522 INFO L225 Difference]: With dead ends: 89 [2019-01-11 14:15:51,522 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 14:15:51,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 14:15:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 14:15:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-11 14:15:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 14:15:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-11 14:15:51,526 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-11 14:15:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:51,527 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-11 14:15:51,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-11 14:15:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-11 14:15:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 14:15:51,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:51,527 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-11 14:15:51,528 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-11 14:15:51,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:51,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:51,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:51,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:54,296 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-11 14:15:54,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:54,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:54,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:54,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:54,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:54,296 INFO 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-11 14:15:54,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:15:54,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:15:55,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-11 14:15:55,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:55,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:55,359 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-11 14:15:55,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:03,111 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-11 14:16:03,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:03,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-11 14:16:03,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:03,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 14:16:03,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 14:16:03,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 14:16:03,134 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-11 14:16:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:03,281 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-11 14:16:03,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 14:16:03,282 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-11 14:16:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:03,282 INFO L225 Difference]: With dead ends: 90 [2019-01-11 14:16:03,283 INFO L226 Difference]: Without dead ends: 88 [2019-01-11 14:16:03,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 14:16:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-11 14:16:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-11 14:16:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-11 14:16:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-11 14:16:03,286 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-11 14:16:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:03,286 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-11 14:16:03,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 14:16:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-11 14:16:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-11 14:16:03,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:03,287 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-11 14:16:03,287 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:03,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-11 14:16:03,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:03,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:03,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:03,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:03,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:05,790 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-11 14:16:05,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:05,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:05,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:05,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:05,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:05,791 INFO 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-11 14:16:05,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:16:05,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:16:05,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:16:05,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:05,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:05,888 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-11 14:16:05,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:13,636 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-11 14:16:13,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:13,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-11 14:16:13,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:13,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-11 14:16:13,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-11 14:16:13,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 14:16:13,657 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-11 14:16:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:13,817 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-11 14:16:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 14:16:13,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-11 14:16:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:13,818 INFO L225 Difference]: With dead ends: 91 [2019-01-11 14:16:13,818 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 14:16:13,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 14:16:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 14:16:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-11 14:16:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 14:16:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-11 14:16:13,821 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-11 14:16:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:13,821 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-11 14:16:13,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-11 14:16:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-11 14:16:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 14:16:13,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:13,822 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-11 14:16:13,822 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:13,823 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-11 14:16:13,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:13,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:13,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:16,384 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-11 14:16:16,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:16,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:16,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:16,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:16,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:16,385 INFO 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-11 14:16:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:16,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:16:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:16,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:16,483 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-11 14:16:16,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:24,361 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-11 14:16:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-11 14:16:24,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 14:16:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 14:16:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 14:16:24,381 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-11 14:16:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:24,729 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-11 14:16:24,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 14:16:24,729 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-11 14:16:24,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:24,730 INFO L225 Difference]: With dead ends: 92 [2019-01-11 14:16:24,730 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 14:16:24,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 14:16:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 14:16:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-11 14:16:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-11 14:16:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-11 14:16:24,733 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-11 14:16:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:24,733 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-11 14:16:24,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 14:16:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-11 14:16:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-11 14:16:24,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:24,734 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-11 14:16:24,734 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-11 14:16:24,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:24,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:24,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:27,469 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-11 14:16:27,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:27,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:27,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:27,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:27,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:27,470 INFO 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-11 14:16:27,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:16:27,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:16:28,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-11 14:16:28,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:28,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:28,621 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-11 14:16:28,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:36,500 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-11 14:16:36,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:36,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-11 14:16:36,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:36,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 14:16:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 14:16:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 14:16:36,522 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-11 14:16:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:36,754 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-11 14:16:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 14:16:36,755 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-11 14:16:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:36,755 INFO L225 Difference]: With dead ends: 93 [2019-01-11 14:16:36,755 INFO L226 Difference]: Without dead ends: 91 [2019-01-11 14:16:36,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 14:16:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-11 14:16:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-11 14:16:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 14:16:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-11 14:16:36,759 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-11 14:16:36,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:36,759 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-11 14:16:36,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 14:16:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-11 14:16:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 14:16:36,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:36,760 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-11 14:16:36,760 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-11 14:16:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:36,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:36,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:39,793 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-11 14:16:39,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:39,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:39,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:39,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:39,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:39,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 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-11 14:16:39,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:16:39,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:16:39,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:16:39,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:39,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:39,908 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-11 14:16:39,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:47,970 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-11 14:16:47,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:47,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-11 14:16:47,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 14:16:47,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 14:16:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 14:16:47,991 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-11 14:16:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:48,118 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-11 14:16:48,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 14:16:48,118 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-11 14:16:48,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:48,119 INFO L225 Difference]: With dead ends: 94 [2019-01-11 14:16:48,119 INFO L226 Difference]: Without dead ends: 92 [2019-01-11 14:16:48,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 14:16:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-11 14:16:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-11 14:16:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-11 14:16:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-11 14:16:48,122 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-11 14:16:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:48,122 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-11 14:16:48,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 14:16:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-11 14:16:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-11 14:16:48,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:48,123 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-11 14:16:48,123 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-11 14:16:48,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:48,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:48,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:51,097 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-11 14:16:51,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:51,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:51,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:51,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:51,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:51,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:16:51,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:51,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:16:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:51,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:51,198 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-11 14:16:51,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:59,634 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-11 14:16:59,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:59,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-11 14:16:59,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:59,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-11 14:16:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-11 14:16:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 14:16:59,655 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-11 14:16:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:59,874 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-11 14:16:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 14:16:59,875 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-11 14:16:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:59,875 INFO L225 Difference]: With dead ends: 95 [2019-01-11 14:16:59,875 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 14:16:59,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 14:16:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 14:16:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 14:16:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 14:16:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-11 14:16:59,878 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-11 14:16:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:59,878 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-11 14:16:59,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-11 14:16:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-11 14:16:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 14:16:59,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:59,879 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-11 14:16:59,879 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:16:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-11 14:16:59,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:59,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:59,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:02,681 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-11 14:17:02,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:02,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:02,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:02,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:02,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:02,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:17:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:17:02,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:17:03,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-11 14:17:03,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:04,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:04,016 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-11 14:17:04,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:12,666 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-11 14:17:12,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:12,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-11 14:17:12,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:12,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 14:17:12,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 14:17:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 14:17:12,688 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-11 14:17:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:12,820 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-11 14:17:12,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-11 14:17:12,820 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-11 14:17:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:12,821 INFO L225 Difference]: With dead ends: 96 [2019-01-11 14:17:12,821 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 14:17:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 14:17:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 14:17:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-11 14:17:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-11 14:17:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-11 14:17:12,825 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-11 14:17:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:12,825 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-11 14:17:12,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 14:17:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-11 14:17:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-11 14:17:12,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:12,826 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-11 14:17:12,827 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:17:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:12,827 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-11 14:17:12,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:12,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:17:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:12,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:15,930 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-11 14:17:15,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:15,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:15,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:15,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:15,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:15,931 INFO 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-11 14:17:15,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:17:15,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:17:16,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:17:16,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:16,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:16,038 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-11 14:17:16,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:24,597 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-11 14:17:24,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:24,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-11 14:17:24,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:24,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-11 14:17:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-11 14:17:24,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 14:17:24,618 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-11 14:17:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:24,944 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-11 14:17:24,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-11 14:17:24,945 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-11 14:17:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:24,945 INFO L225 Difference]: With dead ends: 97 [2019-01-11 14:17:24,946 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 14:17:24,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 14:17:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 14:17:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-11 14:17:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 14:17:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-11 14:17:24,949 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-11 14:17:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:24,950 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-11 14:17:24,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-11 14:17:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-11 14:17:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 14:17:24,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:24,951 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-11 14:17:24,951 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:17:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:24,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-11 14:17:24,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:24,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:17:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:24,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:27,988 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-11 14:17:27,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:27,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:27,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:27,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:27,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:27,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:17:27,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:17:27,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:17:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:28,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:28,095 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-11 14:17:28,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:36,849 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-11 14:17:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-11 14:17:36,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:36,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 14:17:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 14:17:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 14:17:36,871 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-11 14:17:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:37,059 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-11 14:17:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-11 14:17:37,060 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-11 14:17:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:37,061 INFO L225 Difference]: With dead ends: 98 [2019-01-11 14:17:37,061 INFO L226 Difference]: Without dead ends: 96 [2019-01-11 14:17:37,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 14:17:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-11 14:17:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-11 14:17:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 14:17:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-11 14:17:37,065 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-11 14:17:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:37,065 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-11 14:17:37,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 14:17:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-11 14:17:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 14:17:37,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:37,066 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-11 14:17:37,066 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:17:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-11 14:17:37,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:37,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:37,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:17:37,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:37,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:40,057 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-11 14:17:40,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:40,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:40,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:40,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:40,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:40,058 INFO 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-11 14:17:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:17:40,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:17:41,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-11 14:17:41,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:41,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:41,505 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-11 14:17:41,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:50,569 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-11 14:17:50,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:50,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-11 14:17:50,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:50,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 14:17:50,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 14:17:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 14:17:50,591 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-11 14:17:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:50,743 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-11 14:17:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 14:17:50,743 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-11 14:17:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:50,744 INFO L225 Difference]: With dead ends: 99 [2019-01-11 14:17:50,744 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 14:17:50,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 14:17:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 14:17:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 14:17:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 14:17:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-11 14:17:50,760 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-11 14:17:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:50,760 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-11 14:17:50,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 14:17:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-11 14:17:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 14:17:50,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:50,761 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-11 14:17:50,761 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:17:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-11 14:17:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:50,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:17:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:50,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:53,816 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-11 14:17:53,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:53,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:53,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:53,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:53,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:53,817 INFO 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-11 14:17:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:17:53,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:17:53,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:17:53,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:53,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:53,933 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-11 14:17:53,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:03,353 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-11 14:18:03,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:03,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-11 14:18:03,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:03,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 14:18:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 14:18:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 14:18:03,375 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-11 14:18:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:03,522 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-11 14:18:03,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-11 14:18:03,523 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-11 14:18:03,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:03,524 INFO L225 Difference]: With dead ends: 100 [2019-01-11 14:18:03,524 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 14:18:03,525 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-11 14:18:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 14:18:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-11 14:18:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 14:18:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-11 14:18:03,529 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-11 14:18:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:03,529 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-11 14:18:03,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 14:18:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-11 14:18:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 14:18:03,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:03,529 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-11 14:18:03,530 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-11 14:18:03,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:03,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:03,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:06,980 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-11 14:18:06,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:06,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:06,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:06,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:06,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:06,981 INFO 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-11 14:18:06,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:06,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:18:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:07,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:07,093 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-11 14:18:07,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:16,692 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-11 14:18:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-11 14:18:16,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:16,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-11 14:18:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-11 14:18:16,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 14:18:16,713 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-11 14:18:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:16,880 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-11 14:18:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-11 14:18:16,881 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-11 14:18:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:16,881 INFO L225 Difference]: With dead ends: 101 [2019-01-11 14:18:16,881 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 14:18:16,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 14:18:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 14:18:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-11 14:18:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 14:18:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-11 14:18:16,886 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-11 14:18:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:16,886 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-11 14:18:16,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-11 14:18:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-11 14:18:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 14:18:16,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:16,887 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-11 14:18:16,887 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:16,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-11 14:18:16,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:16,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:16,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:16,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:20,066 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-11 14:18:20,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:20,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:20,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:20,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:20,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:20,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:18:20,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:18:20,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:18:21,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-11 14:18:21,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:18:21,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:21,772 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-11 14:18:21,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:31,259 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-11 14:18:31,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:31,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-11 14:18:31,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:31,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 14:18:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 14:18:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 14:18:31,283 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-11 14:18:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:31,513 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-11 14:18:31,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-11 14:18:31,515 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-11 14:18:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:31,515 INFO L225 Difference]: With dead ends: 102 [2019-01-11 14:18:31,515 INFO L226 Difference]: Without dead ends: 100 [2019-01-11 14:18:31,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 14:18:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-11 14:18:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-11 14:18:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 14:18:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-11 14:18:31,519 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-11 14:18:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:31,520 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-11 14:18:31,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 14:18:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-11 14:18:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 14:18:31,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:31,520 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-11 14:18:31,521 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:31,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-11 14:18:31,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:31,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:31,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:34,817 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-11 14:18:34,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:34,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:34,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:34,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:34,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:34,818 INFO 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-11 14:18:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:18:34,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:18:34,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:18:34,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:18:34,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:34,928 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-11 14:18:34,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:44,747 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-11 14:18:44,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:44,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-11 14:18:44,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:44,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-11 14:18:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-11 14:18:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 14:18:44,767 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-11 14:18:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:44,977 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-11 14:18:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 14:18:44,977 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-11 14:18:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:44,978 INFO L225 Difference]: With dead ends: 103 [2019-01-11 14:18:44,978 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 14:18:44,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 14:18:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 14:18:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-11 14:18:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 14:18:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-11 14:18:44,981 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-11 14:18:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:44,982 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-11 14:18:44,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-11 14:18:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-11 14:18:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 14:18:44,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:44,983 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-11 14:18:44,983 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:44,983 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-11 14:18:44,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:44,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:44,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:44,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:44,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:48,540 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-11 14:18:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:48,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:48,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:48,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:48,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:48,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:18:48,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:48,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:18:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:48,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:48,654 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-11 14:18:48,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:58,758 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-11 14:18:58,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:58,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-11 14:18:58,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:58,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 14:18:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 14:18:58,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 14:18:58,779 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-11 14:18:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:59,086 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-11 14:18:59,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-11 14:18:59,086 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-11 14:18:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:59,087 INFO L225 Difference]: With dead ends: 104 [2019-01-11 14:18:59,087 INFO L226 Difference]: Without dead ends: 102 [2019-01-11 14:18:59,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 14:18:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-11 14:18:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-11 14:18:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 14:18:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-11 14:18:59,091 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-11 14:18:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-11 14:18:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 14:18:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-11 14:18:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 14:18:59,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:59,092 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-11 14:18:59,092 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:18:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-11 14:18:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:59,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:59,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:02,817 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-11 14:19:02,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:02,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:02,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:02,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:02,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:02,818 INFO 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-11 14:19:02,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:19:02,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:19:04,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-11 14:19:04,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:04,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:04,661 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-11 14:19:04,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:14,917 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-11 14:19:14,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:14,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-11 14:19:14,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:14,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 14:19:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 14:19:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 14:19:14,940 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-11 14:19:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:15,176 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-11 14:19:15,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-11 14:19:15,176 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-11 14:19:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:15,177 INFO L225 Difference]: With dead ends: 105 [2019-01-11 14:19:15,177 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 14:19:15,178 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-11 14:19:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 14:19:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-11 14:19:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 14:19:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-11 14:19:15,181 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-11 14:19:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:15,181 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-11 14:19:15,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 14:19:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-11 14:19:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 14:19:15,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:15,182 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-11 14:19:15,182 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-11 14:19:15,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:15,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:19:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:15,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:19,007 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-11 14:19:19,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:19,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:19,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:19,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:19,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:19,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:19:19,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:19:19,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:19:19,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:19:19,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:19,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:19,124 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-11 14:19:19,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:29,641 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-11 14:19:29,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:29,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-11 14:19:29,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:29,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 14:19:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 14:19:29,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 14:19:29,662 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-11 14:19:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:29,923 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-11 14:19:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-11 14:19:29,923 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-11 14:19:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:29,924 INFO L225 Difference]: With dead ends: 106 [2019-01-11 14:19:29,924 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 14:19:29,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 14:19:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 14:19:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-11 14:19:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 14:19:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-11 14:19:29,927 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-11 14:19:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:29,928 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-11 14:19:29,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 14:19:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-11 14:19:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-11 14:19:29,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:29,928 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-11 14:19:29,929 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:29,929 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-11 14:19:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:29,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:19:29,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:29,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:33,719 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-11 14:19:33,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:33,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:33,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:33,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:33,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:33,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 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-11 14:19:33,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:33,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:19:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:33,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:33,850 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-11 14:19:33,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:44,928 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-11 14:19:44,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-11 14:19:44,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:44,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-11 14:19:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-11 14:19:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 14:19:44,949 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-11 14:19:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:45,132 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-11 14:19:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 14:19:45,132 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-11 14:19:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:45,133 INFO L225 Difference]: With dead ends: 107 [2019-01-11 14:19:45,133 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 14:19:45,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-11 14:19:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 14:19:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 14:19:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 14:19:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-11 14:19:45,138 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-11 14:19:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:45,138 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-11 14:19:45,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-11 14:19:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-11 14:19:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 14:19:45,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:45,139 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-11 14:19:45,139 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:19:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-11 14:19:45,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:45,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:45,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:45,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:45,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:48,998 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-11 14:19:48,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:48,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:48,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:48,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:48,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:48,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:19:49,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:19:49,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:19:51,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-11 14:19:51,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:51,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:51,125 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-11 14:19:51,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:02,115 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-11 14:20:02,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:02,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-11 14:20:02,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:02,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 14:20:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 14:20:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 14:20:02,140 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-11 14:20:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:02,486 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-11 14:20:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-11 14:20:02,486 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-11 14:20:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:02,487 INFO L225 Difference]: With dead ends: 108 [2019-01-11 14:20:02,487 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 14:20:02,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 14:20:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 14:20:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-11 14:20:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 14:20:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-11 14:20:02,491 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-11 14:20:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:02,492 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-11 14:20:02,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 14:20:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-11 14:20:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 14:20:02,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:02,493 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-11 14:20:02,493 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-11 14:20:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:02,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:02,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:02,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:06,458 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-11 14:20:06,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:06,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:06,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:06,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:06,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:06,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:20:06,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:20:06,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:20:06,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:20:06,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:20:06,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:06,589 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-11 14:20:06,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:17,827 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-11 14:20:17,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:17,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-11 14:20:17,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:17,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-11 14:20:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-11 14:20:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 14:20:17,849 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-11 14:20:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:18,151 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-11 14:20:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-11 14:20:18,151 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-11 14:20:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:18,152 INFO L225 Difference]: With dead ends: 109 [2019-01-11 14:20:18,152 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 14:20:18,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 14:20:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 14:20:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-11 14:20:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 14:20:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-11 14:20:18,156 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-11 14:20:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:18,156 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-11 14:20:18,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-11 14:20:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-11 14:20:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 14:20:18,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:18,157 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-11 14:20:18,157 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-11 14:20:18,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:18,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:18,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:22,275 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-11 14:20:22,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:22,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:22,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:22,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:22,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:22,276 INFO 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-11 14:20:22,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:22,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:22,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:22,406 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-11 14:20:22,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:33,767 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-11 14:20:33,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:33,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-11 14:20:33,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:33,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 14:20:33,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 14:20:33,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 14:20:33,789 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-11 14:20:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:34,044 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-11 14:20:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-11 14:20:34,051 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-11 14:20:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:34,052 INFO L225 Difference]: With dead ends: 110 [2019-01-11 14:20:34,052 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 14:20:34,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 14:20:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 14:20:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-11 14:20:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 14:20:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-11 14:20:34,056 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-11 14:20:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:34,056 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-11 14:20:34,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 14:20:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-11 14:20:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-11 14:20:34,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:34,057 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-11 14:20:34,057 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-11 14:20:34,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:34,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:34,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:37,987 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-11 14:20:37,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:37,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:37,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:37,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:37,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:37,987 INFO 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-11 14:20:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:20:37,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:20:40,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-11 14:20:40,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:20:40,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:40,432 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-11 14:20:40,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:51,862 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-11 14:20:51,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:51,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-11 14:20:51,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:51,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 14:20:51,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 14:20:51,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 14:20:51,887 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-11 14:20:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:52,129 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-11 14:20:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-11 14:20:52,129 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-11 14:20:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:52,129 INFO L225 Difference]: With dead ends: 111 [2019-01-11 14:20:52,129 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 14:20:52,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 14:20:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 14:20:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-11 14:20:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 14:20:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-11 14:20:52,133 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-11 14:20:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:52,133 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-11 14:20:52,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 14:20:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-11 14:20:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 14:20:52,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:52,134 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-11 14:20:52,134 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:20:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-11 14:20:52,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:52,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:52,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:52,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:56,168 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-11 14:20:56,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:56,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:56,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:56,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:56,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:56,169 INFO 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-11 14:20:56,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:20:56,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:20:56,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:20:56,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:20:56,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:56,293 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-11 14:20:56,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:08,176 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-11 14:21:08,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-11 14:21:08,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:08,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 14:21:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 14:21:08,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 14:21:08,198 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-11 14:21:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:08,438 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-11 14:21:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-11 14:21:08,438 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-11 14:21:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:08,439 INFO L225 Difference]: With dead ends: 112 [2019-01-11 14:21:08,439 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 14:21:08,440 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-11 14:21:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 14:21:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-11 14:21:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-11 14:21:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-11 14:21:08,442 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-11 14:21:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:08,442 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-11 14:21:08,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 14:21:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-11 14:21:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-11 14:21:08,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:08,443 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-11 14:21:08,443 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-11 14:21:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:08,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:08,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:12,636 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-11 14:21:12,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:12,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:12,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:12,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:12,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:12,637 INFO 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-11 14:21:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:12,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:12,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:12,761 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-11 14:21:12,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:24,744 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-11 14:21:24,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:24,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-11 14:21:24,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:24,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-11 14:21:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-11 14:21:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 14:21:24,765 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-11 14:21:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:25,052 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-11 14:21:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-11 14:21:25,053 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-11 14:21:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:25,053 INFO L225 Difference]: With dead ends: 113 [2019-01-11 14:21:25,053 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 14:21:25,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 14:21:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 14:21:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 14:21:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 14:21:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-11 14:21:25,057 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-11 14:21:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:25,057 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-11 14:21:25,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-11 14:21:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-11 14:21:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 14:21:25,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:25,058 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-11 14:21:25,058 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-11 14:21:25,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:25,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:25,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:29,548 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-11 14:21:29,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:29,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:29,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:29,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:29,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:29,548 INFO 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-11 14:21:29,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:29,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:32,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-11 14:21:32,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:32,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:32,321 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-11 14:21:32,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:44,581 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-11 14:21:44,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:44,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-11 14:21:44,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:44,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 14:21:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 14:21:44,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 14:21:44,607 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-11 14:21:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:44,967 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-11 14:21:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-11 14:21:44,967 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-11 14:21:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:44,968 INFO L225 Difference]: With dead ends: 114 [2019-01-11 14:21:44,968 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 14:21:44,970 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-11 14:21:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 14:21:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-11 14:21:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 14:21:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-11 14:21:44,972 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-11 14:21:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:44,972 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-11 14:21:44,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 14:21:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-11 14:21:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 14:21:44,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:44,973 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-11 14:21:44,973 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:21:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-11 14:21:44,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:44,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:44,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:49,445 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-11 14:21:49,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:49,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:49,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:49,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:49,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:49,446 INFO 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-11 14:21:49,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:21:49,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:21:49,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:21:49,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:49,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:49,572 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-11 14:21:49,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:02,156 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-11 14:22:02,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:02,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-11 14:22:02,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:02,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-11 14:22:02,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-11 14:22:02,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 14:22:02,178 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-11 14:22:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:02,435 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-11 14:22:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-11 14:22:02,436 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-11 14:22:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:02,437 INFO L225 Difference]: With dead ends: 115 [2019-01-11 14:22:02,437 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 14:22:02,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 14:22:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 14:22:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-11 14:22:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 14:22:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-11 14:22:02,441 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-11 14:22:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:02,441 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-11 14:22:02,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-11 14:22:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-11 14:22:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-11 14:22:02,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:02,442 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-11 14:22:02,442 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:02,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-11 14:22:02,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:02,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:02,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:02,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:02,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:06,881 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-11 14:22:06,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:06,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:06,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:06,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:06,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:06,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 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-11 14:22:06,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:06,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:06,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:07,010 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-11 14:22:07,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:19,888 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-11 14:22:19,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-11 14:22:19,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:19,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 14:22:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 14:22:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 14:22:19,909 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-11 14:22:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:20,148 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-11 14:22:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-11 14:22:20,148 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-11 14:22:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:20,149 INFO L225 Difference]: With dead ends: 116 [2019-01-11 14:22:20,149 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 14:22:20,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 14:22:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 14:22:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-11 14:22:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-11 14:22:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-11 14:22:20,153 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-11 14:22:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:20,153 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-11 14:22:20,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 14:22:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-11 14:22:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-11 14:22:20,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:20,154 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-11 14:22:20,154 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:20,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-11 14:22:20,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:20,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:20,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:20,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:20,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:24,602 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-11 14:22:24,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:24,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:24,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:24,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:24,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:24,602 INFO 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-11 14:22:24,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:24,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:27,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-11 14:22:27,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:27,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:27,457 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-11 14:22:27,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:40,251 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-11 14:22:40,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:40,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-11 14:22:40,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:40,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 14:22:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 14:22:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 14:22:40,276 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-11 14:22:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:40,653 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-11 14:22:40,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-11 14:22:40,654 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-11 14:22:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:40,654 INFO L225 Difference]: With dead ends: 117 [2019-01-11 14:22:40,654 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 14:22:40,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 14:22:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 14:22:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-11 14:22:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-11 14:22:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-11 14:22:40,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-11 14:22:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:40,659 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-11 14:22:40,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 14:22:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-11 14:22:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-11 14:22:40,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:40,660 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-11 14:22:40,660 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-11 14:22:40,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:40,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:40,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,365 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-11 14:22:45,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:45,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:45,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:45,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,366 INFO 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-11 14:22:45,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:22:45,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:22:45,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:22:45,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:45,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:45,498 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-11 14:22:45,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:58,803 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-11 14:22:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:58,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2019-01-11 14:22:58,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:58,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-11 14:22:58,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-11 14:22:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2019-01-11 14:22:58,825 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-01-11 14:22:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:59,137 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-11 14:22:59,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-01-11 14:22:59,138 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-01-11 14:22:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:59,138 INFO L225 Difference]: With dead ends: 118 [2019-01-11 14:22:59,138 INFO L226 Difference]: Without dead ends: 116 [2019-01-11 14:22:59,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2019-01-11 14:22:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-11 14:22:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-11 14:22:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 14:22:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-11 14:22:59,142 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-01-11 14:22:59,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:59,142 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-11 14:22:59,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-11 14:22:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-11 14:22:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-11 14:22:59,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:59,143 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-01-11 14:22:59,143 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:59,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:59,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2019-01-11 14:22:59,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:59,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:59,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:59,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:59,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat