java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:25:57,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:25:57,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:25:57,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:25:57,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:25:57,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:25:57,922 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:25:57,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:25:57,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:25:57,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:25:57,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:25:57,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:25:57,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:25:57,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:25:57,930 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:25:57,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:25:57,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:25:57,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:25:57,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:25:57,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:25:57,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:25:57,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:25:57,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:25:57,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:25:57,943 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:25:57,944 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:25:57,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:25:57,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:25:57,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:25:57,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:25:57,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:25:57,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:25:57,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:25:57,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:25:57,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:25:57,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:25:57,951 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:25:57,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:25:57,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:25:57,966 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:25:57,966 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:25:57,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:25:57,966 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:25:57,966 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:25:57,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:25:57,967 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:25:57,967 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:25:57,967 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:25:57,967 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:25:57,967 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:25:57,968 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:25:57,968 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:25:57,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:25:57,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:25:57,969 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:25:57,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:25:57,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:25:57,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:25:57,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:25:57,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:25:57,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:25:57,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:25:57,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:25:57,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:25:57,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:25:57,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:25:57,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:25:57,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:25:57,972 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:25:57,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:25:57,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:25:57,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:25:57,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:25:57,973 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:25:57,973 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:25:57,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:25:57,973 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:25:57,974 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:25:58,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:25:58,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:25:58,020 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:25:58,022 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:25:58,023 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:25:58,023 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-12-03 16:25:58,024 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-12-03 16:25:58,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:25:58,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:25:58,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:58,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:25:58,067 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:25:58,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:25:58,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:25:58,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:25:58,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:25:58,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... [2018-12-03 16:25:58,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:25:58,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:25:58,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:25:58,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:25:58,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:25:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:25:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:25:58,487 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:25:58,487 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 16:25:58,487 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:58 BoogieIcfgContainer [2018-12-03 16:25:58,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:25:58,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:25:58,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:25:58,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:25:58,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:25:58" (1/2) ... [2018-12-03 16:25:58,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe9db1c and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:25:58, skipping insertion in model container [2018-12-03 16:25:58,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:25:58" (2/2) ... [2018-12-03 16:25:58,497 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-12-03 16:25:58,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:25:58,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:25:58,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:25:58,567 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:25:58,567 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:25:58,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:25:58,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:25:58,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:25:58,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:25:58,568 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:25:58,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:25:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 16:25:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:25:58,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:58,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:25:58,594 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:58,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-03 16:25:58,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:58,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:58,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:58,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:25:58,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:25:58,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:25:58,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:25:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:25:58,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:25:58,767 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 16:25:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:58,889 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-03 16:25:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:25:58,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 16:25:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:58,907 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:25:58,907 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:25:58,912 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 [2018-12-03 16:25:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:25:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:25:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:25:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:25:58,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-03 16:25:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:58,955 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:25:58,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:25:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:25:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:25:58,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:58,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:25:58,956 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:58,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-03 16:25:58,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:58,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:25:59,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:59,096 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 16:25:59,098 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-03 16:25:59,141 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:25:59,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:26:00,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:26:00,353 INFO L272 AbstractInterpreter]: Visited 6 different actions 19 times. Merged at 4 different actions 11 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:26:00,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:26:00,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,405 INFO L192 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 [2018-12-03 16:26:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:00,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:00,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:26:00,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:26:00,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:26:00,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:26:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:26:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:26:00,553 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 16:26:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:00,652 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 16:26:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:26:00,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 16:26:00,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:00,653 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:26:00,653 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:26:00,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:26:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:26:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:26:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:26:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 16:26:00,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 16:26:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:00,658 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 16:26:00,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:26:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 16:26:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:26:00,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:00,660 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 16:26:00,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:00,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-03 16:26:00,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:00,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:26:00,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:00,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:00,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:00,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:00,758 INFO L192 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 [2018-12-03 16:26:00,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:00,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:00,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:26:00,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:00,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:26:00,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 16:26:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:26:00,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:26:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:26:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:26:00,927 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-03 16:26:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:00,982 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-03 16:26:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:26:00,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-03 16:26:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:00,984 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:26:00,984 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:26:00,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:26:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:26:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:26:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:26:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 16:26:00,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-03 16:26:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:00,989 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 16:26:00,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:26:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 16:26:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:26:00,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:00,990 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-03 16:26:00,990 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:00,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-03 16:26:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:26:01,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:01,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:01,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:01,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,097 INFO L192 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 [2018-12-03 16:26:01,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:01,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:01,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:01,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:01,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:26:01,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 16:26:01,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:01,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:26:01,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:01,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:26:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:26:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:26:01,363 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-03 16:26:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:01,634 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 16:26:01,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:26:01,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 16:26:01,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:01,635 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:26:01,635 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:26:01,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:26:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:26:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:26:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:26:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 16:26:01,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-03 16:26:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 16:26:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:26:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 16:26:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:26:01,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:01,646 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-03 16:26:01,646 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:01,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:01,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-03 16:26:01,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:01,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:01,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:01,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:01,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:26:01,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:01,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:01,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:01,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:01,831 INFO L192 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 [2018-12-03 16:26:01,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:01,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:01,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:26:01,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 16:26:02,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:02,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:26:02,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:02,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:26:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:26:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:26:02,026 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-03 16:26:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:02,072 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-03 16:26:02,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:26:02,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 16:26:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:02,075 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:26:02,075 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:26:02,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:26:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:26:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:26:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:26:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 16:26:02,079 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 16:26:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:02,080 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 16:26:02,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:26:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 16:26:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:26:02,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:02,081 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-03 16:26:02,081 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:02,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-03 16:26:02,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:02,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:02,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:26:02,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:02,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:02,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:02,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,200 INFO L192 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 [2018-12-03 16:26:02,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:02,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:02,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:26:02,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:02,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:26:02,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 16:26:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:26:02,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:02,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:26:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:26:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:26:02,558 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-03 16:26:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:02,626 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-03 16:26:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:26:02,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 16:26:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:02,627 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:26:02,628 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:26:02,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:26:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:26:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:26:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:26:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-03 16:26:02,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-03 16:26:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:02,632 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-03 16:26:02,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:26:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-03 16:26:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:26:02,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:02,634 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-03 16:26:02,634 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:02,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-03 16:26:02,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:02,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:02,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 16:26:02,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:02,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:02,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:02,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,858 INFO L192 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 [2018-12-03 16:26:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:02,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:02,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:02,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:02,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 16:26:02,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 16:26:03,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:03,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:26:03,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:03,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:26:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:26:03,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:26:03,199 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-03 16:26:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:03,240 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-03 16:26:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:26:03,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:26:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:03,241 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:26:03,242 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:26:03,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:26:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:26:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:26:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:26:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 16:26:03,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-03 16:26:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:03,248 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 16:26:03,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:26:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 16:26:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:26:03,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:03,249 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-03 16:26:03,249 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:03,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-03 16:26:03,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:03,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 16:26:03,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:03,457 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:03,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:03,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,457 INFO L192 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 [2018-12-03 16:26:03,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:03,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:03,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 16:26:03,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 16:26:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:26:03,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:26:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:26:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:26:03,659 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-03 16:26:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:03,703 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-03 16:26:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:26:03,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 16:26:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:03,706 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:26:03,706 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:26:03,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:26:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:26:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:26:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:26:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 16:26:03,710 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 16:26:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:03,710 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 16:26:03,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:26:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 16:26:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:26:03,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:03,711 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-03 16:26:03,711 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:03,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-03 16:26:03,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:03,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:03,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:03,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:26:03,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:03,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:03,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:03,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:03,857 INFO L192 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 [2018-12-03 16:26:03,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:03,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:03,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:26:03,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:03,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:26:03,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:26:04,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:04,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:26:04,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:04,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:26:04,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:26:04,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:26:04,088 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-03 16:26:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:04,243 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-03 16:26:04,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:26:04,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:26:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:04,245 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:26:04,245 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:26:04,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:26:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:26:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:26:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:26:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-03 16:26:04,251 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-03 16:26:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:04,252 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-03 16:26:04,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:26:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-03 16:26:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:26:04,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:04,254 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-03 16:26:04,254 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:04,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:04,254 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-03 16:26:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:04,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:04,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:04,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 16:26:04,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:04,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:04,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:04,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:04,448 INFO L192 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 [2018-12-03 16:26:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:04,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:04,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:04,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:04,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 16:26:04,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 16:26:05,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:05,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:26:05,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:05,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:26:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:26:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:26:05,187 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-03 16:26:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:05,262 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-03 16:26:05,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:26:05,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 16:26:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:05,263 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:26:05,263 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:26:05,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:26:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:26:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:26:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:26:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 16:26:05,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-03 16:26:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:05,268 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 16:26:05,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:26:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 16:26:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:26:05,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:05,269 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-03 16:26:05,269 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:05,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:05,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-03 16:26:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:05,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:05,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:05,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:26:05,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:05,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:05,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:05,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,530 INFO L192 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 [2018-12-03 16:26:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:05,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:26:05,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 16:26:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:06,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:26:06,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:06,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:26:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:26:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:26:06,113 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 16:26:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:06,168 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-03 16:26:06,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:26:06,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 16:26:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:06,171 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:26:06,171 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:26:06,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:26:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:26:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:26:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:26:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 16:26:06,176 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 16:26:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:06,176 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 16:26:06,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:26:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 16:26:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:26:06,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:06,177 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-03 16:26:06,177 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:06,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-03 16:26:06,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:06,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:06,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 16:26:06,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:06,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:06,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:06,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:06,387 INFO L192 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 [2018-12-03 16:26:06,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:06,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:06,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:26:06,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:06,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 16:26:06,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 16:26:06,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:06,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:26:06,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:06,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:26:06,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:26:06,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:26:06,955 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-03 16:26:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:07,030 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-03 16:26:07,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:26:07,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 16:26:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:07,031 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:26:07,032 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:26:07,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:26:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:26:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:26:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:26:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 16:26:07,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-03 16:26:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:07,037 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 16:26:07,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:26:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 16:26:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:26:07,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:07,038 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-03 16:26:07,039 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:07,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-03 16:26:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 16:26:07,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:07,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:07,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:07,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,281 INFO L192 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 [2018-12-03 16:26:07,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:07,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:07,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:07,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:07,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 16:26:07,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 16:26:07,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:07,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:26:07,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:07,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:26:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:26:07,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:26:07,748 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-03 16:26:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:07,838 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-03 16:26:07,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:26:07,838 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 16:26:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:07,839 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:26:07,840 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:26:07,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:26:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:26:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:26:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:26:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 16:26:07,846 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-03 16:26:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:07,846 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 16:26:07,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:26:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 16:26:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:26:07,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:07,847 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-03 16:26:07,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:07,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-03 16:26:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:07,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 16:26:08,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:08,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:08,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:08,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:08,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:08,075 INFO L192 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 [2018-12-03 16:26:08,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:08,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:08,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 16:26:08,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 16:26:08,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:08,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:26:08,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:08,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:26:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:26:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:26:08,680 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-03 16:26:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:08,746 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-03 16:26:08,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:26:08,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 16:26:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:08,748 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:26:08,748 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:26:08,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:26:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:26:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:26:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:26:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 16:26:08,754 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 16:26:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:08,754 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 16:26:08,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:26:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 16:26:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:26:08,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:08,755 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-03 16:26:08,756 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:08,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-03 16:26:08,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:08,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:08,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:08,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:08,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 16:26:09,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:09,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:09,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:09,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:09,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:09,002 INFO L192 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 [2018-12-03 16:26:09,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:09,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:09,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:26:09,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:09,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 16:26:09,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 16:26:09,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:09,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:26:09,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:09,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:26:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:26:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:26:09,463 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-03 16:26:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:09,517 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-03 16:26:09,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:26:09,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 16:26:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:09,518 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:26:09,518 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:26:09,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:26:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:26:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:26:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:26:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 16:26:09,523 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-03 16:26:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:09,523 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 16:26:09,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:26:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 16:26:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:26:09,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:09,524 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-03 16:26:09,525 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:09,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-03 16:26:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:09,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:09,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 16:26:09,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:09,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:09,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:09,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:09,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:09,756 INFO L192 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 [2018-12-03 16:26:09,765 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:09,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:09,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:09,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:09,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 16:26:09,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 16:26:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:10,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:26:10,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:10,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:26:10,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:26:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:26:10,482 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-03 16:26:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:10,559 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-03 16:26:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:26:10,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 16:26:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:10,560 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:26:10,560 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:26:10,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:26:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:26:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:26:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:26:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 16:26:10,565 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-03 16:26:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:10,566 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 16:26:10,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:26:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 16:26:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:26:10,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:10,567 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-03 16:26:10,567 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:10,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-03 16:26:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:10,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:10,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 16:26:11,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:11,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:11,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:11,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:11,213 INFO L192 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 [2018-12-03 16:26:11,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:11,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:11,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 16:26:11,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 16:26:12,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:12,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:26:12,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:12,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:26:12,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:26:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:26:12,080 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-03 16:26:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:12,143 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-03 16:26:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:26:12,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 16:26:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:12,145 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:26:12,145 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:26:12,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:26:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:26:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:26:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:26:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 16:26:12,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 16:26:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:12,151 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 16:26:12,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:26:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 16:26:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:26:12,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:12,153 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-03 16:26:12,153 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-03 16:26:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:12,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-03 16:26:12,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:12,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:12,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:12,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,427 INFO L192 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 [2018-12-03 16:26:12,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:12,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:12,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:26:12,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:12,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-03 16:26:12,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-03 16:26:13,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:13,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:26:13,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:13,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:26:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:26:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:26:13,424 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-03 16:26:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:13,536 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-03 16:26:13,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:26:13,537 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 16:26:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:13,538 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:26:13,538 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:26:13,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:26:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:26:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:26:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:26:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 16:26:13,543 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-03 16:26:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:13,543 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 16:26:13,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:26:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 16:26:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:26:13,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:13,544 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-03 16:26:13,545 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:13,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-03 16:26:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:13,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 16:26:14,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:14,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:14,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:14,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,303 INFO L192 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 [2018-12-03 16:26:14,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:14,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:14,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:14,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:14,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 16:26:14,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 16:26:15,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:15,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:26:15,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:15,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:26:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:26:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:26:15,224 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-03 16:26:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:15,474 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-03 16:26:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:26:15,474 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 16:26:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:15,475 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:26:15,475 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:26:15,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:26:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:26:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:26:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:26:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 16:26:15,480 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-03 16:26:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:15,480 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 16:26:15,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:26:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 16:26:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:26:15,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:15,481 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-03 16:26:15,481 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:15,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-03 16:26:15,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:15,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:15,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:15,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:15,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-03 16:26:15,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:15,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:15,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:15,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:15,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:15,744 INFO L192 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 [2018-12-03 16:26:15,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:15,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:15,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-03 16:26:15,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-03 16:26:16,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:16,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:26:16,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:16,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:26:16,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:26:16,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:26:16,304 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-03 16:26:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:16,487 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-03 16:26:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:26:16,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 16:26:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:16,488 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:26:16,489 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:26:16,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:26:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:26:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:26:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:26:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 16:26:16,494 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 16:26:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:16,495 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 16:26:16,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:26:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 16:26:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:26:16,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:16,495 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-03 16:26:16,496 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:16,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-03 16:26:16,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:16,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:16,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:26:17,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:17,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:17,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:17,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:17,331 INFO L192 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 [2018-12-03 16:26:17,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:17,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:17,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:26:17,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:17,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:26:17,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 16:26:18,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:18,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:26:18,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:18,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:26:18,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:26:18,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:26:18,028 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-03 16:26:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:18,100 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-03 16:26:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:26:18,100 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 16:26:18,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:18,101 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:26:18,101 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:26:18,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:26:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:26:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:26:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:26:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-03 16:26:18,106 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-03 16:26:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:18,106 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-03 16:26:18,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:26:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-03 16:26:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:26:18,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:18,107 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-03 16:26:18,107 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:18,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-03 16:26:18,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:18,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:18,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-03 16:26:18,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:18,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:18,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:18,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:18,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:18,981 INFO L192 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 [2018-12-03 16:26:18,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:18,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:19,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:19,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:19,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-03 16:26:19,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-03 16:26:19,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:19,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:26:19,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:19,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:26:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:26:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:26:19,722 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-03 16:26:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:19,807 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-03 16:26:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:26:19,810 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 16:26:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:19,811 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:26:19,811 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:26:19,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:26:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:26:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:26:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:26:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 16:26:19,816 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-03 16:26:19,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:19,816 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 16:26:19,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:26:19,816 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 16:26:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:26:19,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:19,817 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-03 16:26:19,817 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:19,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-03 16:26:19,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:19,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:19,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:19,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:19,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 16:26:20,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:20,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:20,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:20,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:20,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:20,111 INFO L192 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 [2018-12-03 16:26:20,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:20,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:20,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 16:26:20,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 16:26:21,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:26:21,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:21,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:26:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:26:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:26:21,282 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-03 16:26:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:21,424 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-03 16:26:21,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:26:21,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 16:26:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:21,426 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:26:21,427 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:26:21,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:26:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:26:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:26:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:26:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 16:26:21,432 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 16:26:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:21,433 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 16:26:21,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:26:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 16:26:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:26:21,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:21,434 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-03 16:26:21,434 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:21,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-03 16:26:21,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:21,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-03 16:26:21,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:21,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:21,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:21,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:21,977 INFO L192 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 [2018-12-03 16:26:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:21,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:22,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:26:22,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:22,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-03 16:26:22,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-03 16:26:22,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:22,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:26:22,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:22,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:26:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:26:22,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:26:22,793 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-03 16:26:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:22,894 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-03 16:26:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:26:22,895 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 16:26:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:22,895 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:26:22,896 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:26:22,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:26:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:26:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:26:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:26:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 16:26:22,901 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-03 16:26:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:22,901 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 16:26:22,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:26:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 16:26:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:26:22,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:22,902 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-03 16:26:22,902 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:22,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-03 16:26:22,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:22,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:22,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 16:26:23,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:23,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:23,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:23,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:23,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:23,438 INFO L192 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 [2018-12-03 16:26:23,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:23,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:23,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:23,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:23,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 16:26:23,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 16:26:24,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:24,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:26:24,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:24,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:26:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:26:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:26:24,248 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-03 16:26:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:24,351 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-03 16:26:24,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:26:24,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 16:26:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:24,353 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:26:24,353 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:26:24,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:26:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:26:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:26:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:26:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 16:26:24,358 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-03 16:26:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:24,358 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 16:26:24,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:26:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 16:26:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:26:24,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:24,359 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-03 16:26:24,359 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:24,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-03 16:26:24,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:24,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:24,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-03 16:26:24,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:24,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:24,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:24,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:24,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:24,978 INFO L192 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 [2018-12-03 16:26:24,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:24,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:25,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-03 16:26:25,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-03 16:26:26,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:26,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:26:26,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:26,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:26:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:26:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:26:26,523 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-03 16:26:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:26,612 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-03 16:26:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:26:26,612 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 16:26:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:26,613 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:26:26,613 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:26:26,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:26:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:26:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:26:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:26:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 16:26:26,618 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 16:26:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:26,618 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 16:26:26,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:26:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 16:26:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:26:26,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:26,619 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-03 16:26:26,619 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:26,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:26,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-03 16:26:26,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:26,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:26,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 16:26:27,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:27,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:27,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:27,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:27,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:27,089 INFO L192 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 [2018-12-03 16:26:27,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:27,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:27,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:26:27,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:27,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 16:26:27,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 16:26:28,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:28,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:26:28,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:28,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:26:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:26:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:26:28,031 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-03 16:26:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:28,127 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-03 16:26:28,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:26:28,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-03 16:26:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:28,128 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:26:28,128 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:26:28,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:26:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:26:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:26:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:26:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 16:26:28,133 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-03 16:26:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:28,134 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 16:26:28,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:26:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 16:26:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:26:28,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:28,134 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-03 16:26:28,135 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:28,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-03 16:26:28,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:28,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:28,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 16:26:28,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:28,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:28,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:28,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:28,699 INFO L192 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 [2018-12-03 16:26:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:28,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:28,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:28,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:28,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 16:26:28,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 16:26:29,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:29,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:26:29,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:29,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:26:29,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:26:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:26:29,888 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-03 16:26:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:30,012 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-03 16:26:30,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:26:30,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 16:26:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:30,013 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:26:30,014 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:26:30,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:26:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:26:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:26:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:26:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 16:26:30,018 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-03 16:26:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:30,019 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 16:26:30,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:26:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 16:26:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:26:30,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:30,020 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-03 16:26:30,020 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:30,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-03 16:26:30,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:30,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 16:26:30,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:30,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:30,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:30,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:30,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:30,836 INFO L192 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 [2018-12-03 16:26:30,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:30,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:30,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 16:26:30,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 16:26:32,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:26:32,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:32,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:26:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:26:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:26:32,121 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-03 16:26:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:32,253 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-03 16:26:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:26:32,254 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 16:26:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:32,255 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:26:32,255 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:26:32,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:26:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:26:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:26:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:26:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 16:26:32,269 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 16:26:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:32,269 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 16:26:32,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:26:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 16:26:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:26:32,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:32,270 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-03 16:26:32,270 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:32,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-03 16:26:32,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-03 16:26:32,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:32,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:32,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:32,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:32,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:32,846 INFO L192 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 [2018-12-03 16:26:32,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:32,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:33,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:26:33,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:33,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-03 16:26:33,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-03 16:26:34,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:34,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:26:34,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:34,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:26:34,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:26:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:26:34,106 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-03 16:26:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:34,212 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-03 16:26:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:26:34,212 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 16:26:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:34,213 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:26:34,213 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:26:34,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:26:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:26:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:26:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:26:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 16:26:34,216 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-03 16:26:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:34,216 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 16:26:34,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:26:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 16:26:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:26:34,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:34,217 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-03 16:26:34,217 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:34,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-03 16:26:34,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:34,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:34,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 16:26:35,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:35,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:35,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:35,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:35,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:35,235 INFO L192 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 [2018-12-03 16:26:35,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:35,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:35,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:35,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:35,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 16:26:35,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 16:26:36,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:36,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:26:36,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:36,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:26:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:26:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:36,720 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-03 16:26:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:36,879 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-03 16:26:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:26:36,879 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 16:26:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:36,880 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:26:36,880 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:26:36,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:26:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:26:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:26:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 16:26:36,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-03 16:26:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:36,884 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 16:26:36,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:26:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 16:26:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:26:36,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:36,884 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-03 16:26:36,885 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:36,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-03 16:26:36,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:36,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:36,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:36,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:36,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-03 16:26:37,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:37,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:37,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:37,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:37,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:37,466 INFO L192 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 [2018-12-03 16:26:37,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:37,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:37,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-03 16:26:37,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-03 16:26:38,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:38,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:26:38,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:38,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:26:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:26:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:38,675 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-03 16:26:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:38,804 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-03 16:26:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:26:38,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 16:26:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:38,805 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:26:38,805 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:26:38,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:26:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:26:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:26:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 16:26:38,810 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 16:26:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:38,810 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 16:26:38,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:26:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 16:26:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:26:38,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:38,811 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-03 16:26:38,811 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:38,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-03 16:26:38,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:38,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:38,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:38,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 16:26:39,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:39,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:39,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:39,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:39,370 INFO L192 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 [2018-12-03 16:26:39,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:39,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:39,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:26:39,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:39,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 16:26:39,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 16:26:41,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:41,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:26:41,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:41,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:26:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:26:41,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:41,073 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-03 16:26:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:41,250 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-03 16:26:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:26:41,250 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-03 16:26:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:41,251 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:26:41,251 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:26:41,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:26:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:26:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:26:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-03 16:26:41,254 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-03 16:26:41,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:41,254 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-03 16:26:41,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:26:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-03 16:26:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:26:41,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:41,255 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-03 16:26:41,255 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:41,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-03 16:26:41,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:41,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:41,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-03 16:26:41,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:41,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:41,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:41,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:41,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:41,864 INFO L192 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 [2018-12-03 16:26:41,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:41,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:41,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:41,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:41,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-03 16:26:41,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-03 16:26:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:26:43,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:43,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:26:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:26:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:43,584 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-03 16:26:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:43,763 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-03 16:26:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:26:43,764 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 16:26:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:43,765 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:26:43,765 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:26:43,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:26:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:26:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:26:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 16:26:43,767 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-03 16:26:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:43,768 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 16:26:43,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:26:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 16:26:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:26:43,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:43,768 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-03 16:26:43,769 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:43,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-03 16:26:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:43,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:43,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 16:26:44,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:44,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:44,349 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:44,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:44,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:44,349 INFO L192 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 [2018-12-03 16:26:44,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:44,358 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:44,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 16:26:44,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 16:26:45,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:45,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:26:45,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:45,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:26:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:26:45,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:45,798 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-03 16:26:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:46,047 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-03 16:26:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:26:46,047 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 16:26:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:46,048 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:26:46,048 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:26:46,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:26:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:26:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:26:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 16:26:46,052 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 16:26:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:46,053 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 16:26:46,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:26:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 16:26:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:26:46,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:46,053 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-03 16:26:46,053 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:46,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-03 16:26:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:46,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:46,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-03 16:26:46,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:46,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:46,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:46,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:46,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:46,802 INFO L192 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 [2018-12-03 16:26:46,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:46,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:47,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:26:47,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:47,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-03 16:26:47,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-03 16:26:48,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:48,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:26:48,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:48,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:26:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:26:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:48,663 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-03 16:26:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:48,810 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-03 16:26:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:26:48,810 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 16:26:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:48,811 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:26:48,811 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:26:48,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:26:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:26:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:26:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 16:26:48,815 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-03 16:26:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:48,815 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 16:26:48,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:26:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 16:26:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:26:48,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:48,816 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-03 16:26:48,816 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-03 16:26:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:48,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:48,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 16:26:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:49,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:49,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:49,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:49,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:49,489 INFO L192 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 [2018-12-03 16:26:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:49,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:49,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:49,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:49,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 16:26:49,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 16:26:51,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:51,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:26:51,312 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:51,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:26:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:26:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:51,314 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-03 16:26:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:51,464 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-03 16:26:51,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:26:51,465 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 16:26:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:51,465 INFO L225 Difference]: With dead ends: 118 [2018-12-03 16:26:51,466 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:26:51,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:26:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:26:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:26:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 16:26:51,469 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-03 16:26:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:51,469 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 16:26:51,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:26:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 16:26:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:26:51,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:51,470 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-03 16:26:51,470 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:51,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-03 16:26:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:51,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:51,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:51,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:51,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-03 16:26:52,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:52,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:52,197 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:52,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:52,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:52,198 INFO L192 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 [2018-12-03 16:26:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:52,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:52,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-03 16:26:52,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-03 16:26:54,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:54,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:26:54,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:54,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:26:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:26:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:54,190 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-03 16:26:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:54,361 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-03 16:26:54,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:26:54,361 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 16:26:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:54,362 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:26:54,362 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:26:54,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:26:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:26:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:26:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 16:26:54,365 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 16:26:54,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:54,365 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 16:26:54,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:26:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 16:26:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:26:54,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:54,366 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-03 16:26:54,366 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:54,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-03 16:26:54,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:54,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:54,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 16:26:55,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:55,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:55,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:55,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:55,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:55,139 INFO L192 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 [2018-12-03 16:26:55,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:55,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:55,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:26:55,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:55,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 16:26:55,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 16:26:57,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:57,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:26:57,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:57,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:26:57,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:26:57,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:26:57,820 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-03 16:26:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:57,969 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-03 16:26:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:26:57,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-03 16:26:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:57,970 INFO L225 Difference]: With dead ends: 124 [2018-12-03 16:26:57,971 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:26:57,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:26:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:26:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:26:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:26:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 16:26:57,975 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-03 16:26:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:57,975 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 16:26:57,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:26:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 16:26:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:26:57,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:57,976 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-03 16:26:57,976 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:57,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-03 16:26:57,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:57,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:57,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:57,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-03 16:26:58,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:58,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:58,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:58,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:58,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:58,746 INFO L192 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 [2018-12-03 16:26:58,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:58,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:58,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:58,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:58,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-03 16:26:58,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-03 16:27:00,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:00,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:27:00,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:00,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:27:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:27:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:27:00,690 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-03 16:27:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:00,848 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-03 16:27:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:27:00,849 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 16:27:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:00,849 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:27:00,850 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:27:00,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:27:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:27:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:27:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:27:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 16:27:00,854 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-03 16:27:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:00,854 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 16:27:00,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:27:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 16:27:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:27:00,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:00,855 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-03 16:27:00,855 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:00,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-03 16:27:00,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:00,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:00,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:00,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:00,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 16:27:02,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:02,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:02,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:02,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:02,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:02,288 INFO L192 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 [2018-12-03 16:27:02,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:02,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:02,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 16:27:02,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 16:27:04,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:04,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:27:04,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:04,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:27:04,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:27:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:27:04,246 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-03 16:27:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:04,425 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-03 16:27:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:27:04,425 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 16:27:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:04,426 INFO L225 Difference]: With dead ends: 130 [2018-12-03 16:27:04,426 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:27:04,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:27:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:27:04,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:27:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:27:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 16:27:04,430 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 16:27:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:04,430 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 16:27:04,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:27:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 16:27:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:27:04,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:04,431 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-03 16:27:04,431 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:04,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-03 16:27:04,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:04,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:04,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-03 16:27:05,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:05,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:05,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:05,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:05,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:05,415 INFO L192 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 [2018-12-03 16:27:05,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:05,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:05,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:27:05,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:05,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-03 16:27:05,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-03 16:27:08,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:08,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:27:08,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:08,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:27:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:27:08,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:08,253 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-03 16:27:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:08,429 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-03 16:27:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:27:08,429 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 16:27:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:08,430 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:27:08,430 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:27:08,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:27:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:27:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:27:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 16:27:08,433 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-03 16:27:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:08,433 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 16:27:08,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:27:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 16:27:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:27:08,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:08,434 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-03 16:27:08,434 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:08,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-03 16:27:08,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:08,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:08,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:08,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:08,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 16:27:09,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:09,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:09,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:09,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:09,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:09,254 INFO L192 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 [2018-12-03 16:27:09,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:09,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:09,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:09,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:09,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 16:27:09,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 16:27:11,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:11,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:27:11,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:11,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:27:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:27:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:11,592 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-03 16:27:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:11,823 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-03 16:27:11,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:27:11,823 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 16:27:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:11,824 INFO L225 Difference]: With dead ends: 136 [2018-12-03 16:27:11,824 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:27:11,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:27:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:27:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:27:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 16:27:11,828 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-03 16:27:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:11,828 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 16:27:11,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:27:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 16:27:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:27:11,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:11,829 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-03 16:27:11,829 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:11,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:11,830 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-03 16:27:11,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:11,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:11,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:11,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-03 16:27:12,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:12,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:12,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:12,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:12,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:12,976 INFO L192 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 [2018-12-03 16:27:12,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:12,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:13,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-03 16:27:13,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-03 16:27:15,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:15,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:27:15,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:15,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:27:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:27:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:15,115 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-03 16:27:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:15,399 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-03 16:27:15,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:27:15,399 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 16:27:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:15,400 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:27:15,400 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:27:15,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:27:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:27:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:27:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 16:27:15,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 16:27:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:15,404 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 16:27:15,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:27:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 16:27:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:27:15,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:15,405 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-03 16:27:15,405 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:15,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:15,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-03 16:27:15,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:15,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:15,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:15,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:15,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:27:16,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:16,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:16,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:16,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:16,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:16,388 INFO L192 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 [2018-12-03 16:27:16,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:16,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:16,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:27:16,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:16,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:27:16,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 16:27:19,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:19,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:27:19,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:19,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:27:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:27:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:27:19,337 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-03 16:27:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:21,236 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-03 16:27:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:27:21,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-03 16:27:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:21,236 INFO L225 Difference]: With dead ends: 142 [2018-12-03 16:27:21,237 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:27:21,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:27:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:27:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:27:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:27:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-03 16:27:21,241 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-03 16:27:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:21,241 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-03 16:27:21,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:27:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-03 16:27:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:27:21,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:21,242 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-03 16:27:21,242 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:21,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-03 16:27:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:21,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:21,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-03 16:27:22,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:22,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:22,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:22,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:22,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:22,483 INFO L192 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 [2018-12-03 16:27:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:22,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:22,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:22,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:22,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-03 16:27:22,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-03 16:27:24,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:24,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:27:24,902 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:24,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:27:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:27:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:27:24,903 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-03 16:27:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:25,182 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-03 16:27:25,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:27:25,184 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 16:27:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:25,185 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:27:25,185 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:27:25,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:27:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:27:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:27:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:27:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 16:27:25,188 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-03 16:27:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:25,188 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 16:27:25,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:27:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 16:27:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:27:25,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:25,188 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-03 16:27:25,189 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:25,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:25,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-03 16:27:25,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 16:27:26,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:26,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:26,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:26,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:26,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:26,826 INFO L192 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 [2018-12-03 16:27:26,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:26,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:26,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 16:27:26,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 16:27:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:27:29,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:27:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:27:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:27:29,419 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-03 16:27:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:29,771 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-03 16:27:29,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:27:29,772 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 16:27:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:29,772 INFO L225 Difference]: With dead ends: 148 [2018-12-03 16:27:29,772 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:27:29,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:27:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:27:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:27:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:27:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 16:27:29,776 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 16:27:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:29,776 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 16:27:29,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:27:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 16:27:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:27:29,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:29,777 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-03 16:27:29,777 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:29,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:29,777 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-03 16:27:29,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:29,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:29,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:29,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:29,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-03 16:27:30,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:30,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:30,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:30,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:30,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:30,717 INFO L192 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 [2018-12-03 16:27:30,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:30,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:31,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:27:31,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:31,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-03 16:27:31,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-03 16:27:35,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:35,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:27:35,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:35,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:27:35,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:27:35,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:27:35,141 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-03 16:27:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:35,335 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-03 16:27:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:27:35,336 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 16:27:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:35,336 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:27:35,336 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:27:35,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:27:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:27:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:27:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:27:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 16:27:35,339 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-03 16:27:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:35,340 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 16:27:35,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:27:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 16:27:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:27:35,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:35,341 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-03 16:27:35,341 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:35,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-03 16:27:35,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:35,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:35,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 16:27:36,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:36,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:36,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:36,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:36,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:36,496 INFO L192 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 [2018-12-03 16:27:36,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:36,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:36,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:36,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:36,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 16:27:36,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 16:27:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:27:39,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:39,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:27:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:27:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:27:39,513 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-03 16:27:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:39,797 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-03 16:27:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:27:39,804 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 16:27:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:39,805 INFO L225 Difference]: With dead ends: 154 [2018-12-03 16:27:39,805 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:27:39,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:27:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:27:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:27:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:27:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 16:27:39,810 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-03 16:27:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:39,810 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 16:27:39,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:27:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 16:27:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:27:39,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:39,811 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-03 16:27:39,811 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:39,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-03 16:27:39,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:39,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:39,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-03 16:27:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:41,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:41,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:41,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:41,788 INFO L192 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 [2018-12-03 16:27:41,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:41,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:41,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-03 16:27:41,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-03 16:27:44,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:44,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:27:44,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:44,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:27:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:27:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:27:44,997 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-03 16:27:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:45,241 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-03 16:27:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:27:45,241 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 16:27:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:45,242 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:27:45,242 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:27:45,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:27:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:27:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:27:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:27:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 16:27:45,246 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 16:27:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:45,246 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 16:27:45,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:27:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 16:27:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:27:45,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:45,247 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-03 16:27:45,247 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:45,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:45,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-03 16:27:45,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:45,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 16:27:46,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:46,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:46,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:46,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:46,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:46,320 INFO L192 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 [2018-12-03 16:27:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:46,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:47,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:27:47,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:47,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 16:27:47,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 16:27:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:27:50,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:27:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:27:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:27:50,789 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-03 16:27:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:51,652 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-03 16:27:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:27:51,652 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-03 16:27:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:51,653 INFO L225 Difference]: With dead ends: 160 [2018-12-03 16:27:51,653 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:27:51,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:27:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:27:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:27:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:27:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 16:27:51,657 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-03 16:27:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:51,657 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 16:27:51,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:27:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 16:27:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:27:51,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:51,658 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-03 16:27:51,658 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:51,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:51,659 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-03 16:27:51,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:51,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:51,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:51,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-03 16:27:53,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:53,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:53,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:53,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:53,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:53,317 INFO L192 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 [2018-12-03 16:27:53,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:53,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:53,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:53,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:53,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-03 16:27:53,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-03 16:27:56,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:56,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:27:56,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:56,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:27:56,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:27:56,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:27:56,321 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-03 16:27:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:56,570 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-03 16:27:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:27:56,570 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 16:27:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:56,571 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:27:56,571 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:27:56,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:27:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:27:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:27:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:27:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 16:27:56,576 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-03 16:27:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:56,576 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 16:27:56,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:27:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 16:27:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:27:56,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:56,577 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-03 16:27:56,577 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:56,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-03 16:27:56,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:56,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:56,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 16:27:58,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:58,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:58,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:58,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,246 INFO L192 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 [2018-12-03 16:27:58,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:58,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:58,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 16:27:58,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 16:28:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:01,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:28:01,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:01,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:28:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:28:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:28:01,298 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-03 16:28:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:01,547 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-03 16:28:01,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:28:01,548 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 16:28:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:01,549 INFO L225 Difference]: With dead ends: 166 [2018-12-03 16:28:01,549 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:28:01,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:28:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:28:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:28:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:28:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 16:28:01,553 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 16:28:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:01,553 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 16:28:01,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:28:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 16:28:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:28:01,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:01,554 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-03 16:28:01,554 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:01,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:01,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-03 16:28:01,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:01,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:01,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-03 16:28:02,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:02,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:02,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:02,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:02,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:02,956 INFO L192 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 [2018-12-03 16:28:02,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:02,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:04,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:28:04,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:04,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-03 16:28:04,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-03 16:28:07,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:07,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:28:07,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:07,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:28:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:28:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:28:07,306 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-03 16:28:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:07,591 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-12-03 16:28:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:28:07,591 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 16:28:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:07,592 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:28:07,592 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:28:07,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:28:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:28:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:28:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:28:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-03 16:28:07,596 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-12-03 16:28:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:07,596 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-03 16:28:07,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:28:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-03 16:28:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:28:07,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:07,597 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-03 16:28:07,597 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:07,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2018-12-03 16:28:07,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:07,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:07,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:07,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 16:28:09,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:09,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:09,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:09,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:09,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:09,028 INFO L192 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 [2018-12-03 16:28:09,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:09,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:09,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:09,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:09,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 16:28:09,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 16:28:12,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:12,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:28:12,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:12,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:28:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:28:12,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:28:12,374 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-03 16:28:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:12,612 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-12-03 16:28:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:28:12,612 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 16:28:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:12,613 INFO L225 Difference]: With dead ends: 172 [2018-12-03 16:28:12,614 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:28:12,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:28:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:28:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:28:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:28:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 16:28:12,618 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-03 16:28:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:12,618 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 16:28:12,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:28:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 16:28:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:28:12,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:12,619 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2018-12-03 16:28:12,619 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:12,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2018-12-03 16:28:12,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:12,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:12,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 16:28:14,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:14,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:14,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:14,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:14,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:14,200 INFO L192 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 [2018-12-03 16:28:14,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:14,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:14,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 16:28:14,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 16:28:18,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:18,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:28:18,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:18,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:28:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:28:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:28:18,397 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-03 16:28:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:18,842 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-03 16:28:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:28:18,842 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 16:28:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:18,843 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:28:18,843 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:28:18,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:28:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:28:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 16:28:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:28:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 16:28:18,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 16:28:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:18,848 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 16:28:18,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:28:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 16:28:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:28:18,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:18,848 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2018-12-03 16:28:18,849 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:18,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:18,849 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2018-12-03 16:28:18,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:18,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:18,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:18,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:18,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-03 16:28:20,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:20,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:20,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:20,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:20,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:20,148 INFO L192 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 [2018-12-03 16:28:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:20,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:21,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:28:21,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:21,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-03 16:28:21,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-03 16:28:25,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:25,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:28:25,131 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:25,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:28:25,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:28:25,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:28:25,132 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-03 16:28:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:25,496 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-12-03 16:28:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:28:25,497 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-03 16:28:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:25,497 INFO L225 Difference]: With dead ends: 178 [2018-12-03 16:28:25,497 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 16:28:25,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:28:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 16:28:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 16:28:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 16:28:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-03 16:28:25,501 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-12-03 16:28:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:25,501 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-03 16:28:25,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:28:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-03 16:28:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:28:25,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:25,502 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2018-12-03 16:28:25,502 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:25,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2018-12-03 16:28:25,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:25,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:25,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-03 16:28:26,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:26,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:26,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:26,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:26,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:26,828 INFO L192 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 [2018-12-03 16:28:26,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:26,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:26,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:26,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:26,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-03 16:28:26,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-03 16:28:30,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:30,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:28:30,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:30,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:28:30,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:28:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:28:30,735 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-03 16:28:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:31,051 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-12-03 16:28:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:28:31,051 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 16:28:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:31,052 INFO L225 Difference]: With dead ends: 181 [2018-12-03 16:28:31,052 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:28:31,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:28:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:28:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 16:28:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:28:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 16:28:31,056 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-12-03 16:28:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:31,056 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 16:28:31,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:28:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 16:28:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:28:31,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:31,057 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2018-12-03 16:28:31,058 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:31,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2018-12-03 16:28:31,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:31,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:31,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:31,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:31,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-03 16:28:32,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:32,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:32,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:32,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:32,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:32,366 INFO L192 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 [2018-12-03 16:28:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:32,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:32,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-03 16:28:32,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-03 16:28:36,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:36,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:28:36,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:36,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:28:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:28:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:28:36,521 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-03 16:28:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:36,920 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-12-03 16:28:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:28:36,920 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 16:28:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:36,921 INFO L225 Difference]: With dead ends: 184 [2018-12-03 16:28:36,921 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:28:36,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:28:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:28:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 16:28:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:28:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 16:28:36,925 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 16:28:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:36,925 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 16:28:36,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:28:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 16:28:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:28:36,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:36,926 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2018-12-03 16:28:36,926 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:36,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:36,927 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2018-12-03 16:28:36,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:36,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:36,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:36,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-03 16:28:38,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:38,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:38,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:38,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:38,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:38,752 INFO L192 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 [2018-12-03 16:28:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:38,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:39,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:28:39,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:39,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-03 16:28:39,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-03 16:28:44,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:44,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:28:44,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:44,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:28:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:28:44,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:28:44,139 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-03 16:28:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:44,487 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-12-03 16:28:44,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:28:44,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 16:28:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:44,488 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:28:44,488 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:28:44,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:28:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:28:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 16:28:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 16:28:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-03 16:28:44,491 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-03 16:28:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:44,492 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-03 16:28:44,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:28:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-03 16:28:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 16:28:44,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:44,493 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2018-12-03 16:28:44,493 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:44,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:44,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2018-12-03 16:28:44,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:44,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:44,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:44,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-03 16:28:45,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:45,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:45,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:45,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:45,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:45,913 INFO L192 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 [2018-12-03 16:28:45,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:45,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:46,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:46,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:46,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-03 16:28:46,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-03 16:28:50,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:50,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:28:50,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:50,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:28:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:28:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:28:50,276 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-03 16:28:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:50,574 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-03 16:28:50,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:28:50,574 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 16:28:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:50,575 INFO L225 Difference]: With dead ends: 190 [2018-12-03 16:28:50,575 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:28:50,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:28:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:28:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 16:28:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 16:28:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 16:28:50,578 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-12-03 16:28:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:50,578 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 16:28:50,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:28:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 16:28:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:28:50,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:50,579 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2018-12-03 16:28:50,579 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:50,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:50,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2018-12-03 16:28:50,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:50,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:50,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:50,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:50,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-03 16:28:52,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:52,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:52,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:52,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:52,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:52,074 INFO L192 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 [2018-12-03 16:28:52,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:52,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:52,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-03 16:28:52,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-03 16:28:56,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:28:56,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:56,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:28:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:28:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:28:56,533 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-03 16:28:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:56,923 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-12-03 16:28:56,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:28:56,924 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 16:28:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:56,924 INFO L225 Difference]: With dead ends: 193 [2018-12-03 16:28:56,924 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 16:28:56,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:28:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 16:28:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 16:28:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 16:28:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 16:28:56,928 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 16:28:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:56,928 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 16:28:56,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:28:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 16:28:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:28:56,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:56,929 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2018-12-03 16:28:56,929 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:56,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2018-12-03 16:28:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:56,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-03 16:28:58,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:58,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:58,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:58,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:58,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:58,457 INFO L192 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 [2018-12-03 16:28:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:58,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:59,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:28:59,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:59,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-03 16:28:59,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-03 16:29:03,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:03,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:29:03,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:03,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:29:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:29:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:29:03,771 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-03 16:29:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:04,228 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-12-03 16:29:04,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:29:04,228 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 16:29:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:04,229 INFO L225 Difference]: With dead ends: 196 [2018-12-03 16:29:04,229 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:29:04,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:29:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:29:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 16:29:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:29:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-03 16:29:04,232 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-03 16:29:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:04,233 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-03 16:29:04,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:29:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-03 16:29:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:29:04,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:04,234 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2018-12-03 16:29:04,234 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:04,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2018-12-03 16:29:04,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:04,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:04,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:04,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-03 16:29:05,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:05,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:05,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:05,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:05,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:05,860 INFO L192 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 [2018-12-03 16:29:05,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:05,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:05,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:05,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:05,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-03 16:29:05,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-03 16:29:10,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:10,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:29:10,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:10,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:29:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:29:10,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:29:10,603 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-03 16:29:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:11,036 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-12-03 16:29:11,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:29:11,036 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 16:29:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:11,037 INFO L225 Difference]: With dead ends: 199 [2018-12-03 16:29:11,037 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:29:11,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:29:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:29:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 16:29:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 16:29:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 16:29:11,042 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-03 16:29:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:11,042 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 16:29:11,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:29:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 16:29:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:29:11,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:11,043 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2018-12-03 16:29:11,043 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:11,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2018-12-03 16:29:11,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:11,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:11,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-03 16:29:12,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:12,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:12,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:12,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:12,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:12,665 INFO L192 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 [2018-12-03 16:29:12,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:12,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:12,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-03 16:29:12,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-03 16:29:17,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:17,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:29:17,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:17,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:29:17,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:29:17,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:29:17,902 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-03 16:29:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:18,395 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-12-03 16:29:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:29:18,395 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 16:29:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:18,396 INFO L225 Difference]: With dead ends: 202 [2018-12-03 16:29:18,396 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:29:18,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:29:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:29:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 16:29:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:29:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 16:29:18,400 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 16:29:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:18,400 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 16:29:18,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:29:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 16:29:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:29:18,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:18,401 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2018-12-03 16:29:18,401 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:18,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2018-12-03 16:29:18,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:18,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:18,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:18,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 16:29:20,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:20,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:20,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:20,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:20,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:20,324 INFO L192 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 [2018-12-03 16:29:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:20,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:23,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:29:23,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:23,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 16:29:23,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 16:29:28,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:28,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:29:28,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:28,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:29:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:29:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:29:28,489 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-03 16:29:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:28,887 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-03 16:29:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:29:28,887 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 16:29:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:28,888 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:29:28,888 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 16:29:28,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:29:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 16:29:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 16:29:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 16:29:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-03 16:29:28,891 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-12-03 16:29:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:28,891 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-03 16:29:28,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:29:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-03 16:29:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 16:29:28,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:28,892 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2018-12-03 16:29:28,892 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:28,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2018-12-03 16:29:28,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:28,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:28,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:28,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:28,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-03 16:29:31,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:31,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:31,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:31,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:31,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:31,165 INFO L192 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 [2018-12-03 16:29:31,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:31,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:31,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:31,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:31,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-03 16:29:31,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-03 16:29:36,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:36,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:29:36,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:36,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:29:36,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:29:36,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:29:36,480 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-03 16:29:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:36,996 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2018-12-03 16:29:36,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:29:36,996 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 16:29:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:36,997 INFO L225 Difference]: With dead ends: 208 [2018-12-03 16:29:36,997 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:29:36,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:29:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:29:36,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 16:29:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 16:29:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 16:29:37,000 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-03 16:29:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:37,000 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 16:29:37,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:29:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 16:29:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:29:37,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:37,001 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2018-12-03 16:29:37,001 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:37,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2018-12-03 16:29:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:37,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:37,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-03 16:29:38,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:38,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:38,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:38,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:38,664 INFO L192 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 [2018-12-03 16:29:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:38,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:38,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-03 16:29:38,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-03 16:29:43,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:43,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:29:43,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:43,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:29:43,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:29:43,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:29:43,986 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-03 16:29:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:44,504 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-12-03 16:29:44,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:29:44,504 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 16:29:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:44,505 INFO L225 Difference]: With dead ends: 211 [2018-12-03 16:29:44,505 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 16:29:44,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:29:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 16:29:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 16:29:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:29:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 16:29:44,508 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 16:29:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:44,508 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 16:29:44,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:29:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 16:29:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 16:29:44,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:44,509 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2018-12-03 16:29:44,509 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:44,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2018-12-03 16:29:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:44,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:44,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-03 16:29:46,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:46,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:46,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:46,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:46,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:46,469 INFO L192 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 [2018-12-03 16:29:46,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:46,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:50,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:29:50,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:50,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-03 16:29:50,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-03 16:29:55,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:55,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:29:55,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:55,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:29:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:29:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:29:55,672 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-03 16:29:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:56,220 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-12-03 16:29:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:29:56,220 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-03 16:29:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:56,221 INFO L225 Difference]: With dead ends: 214 [2018-12-03 16:29:56,221 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:29:56,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:29:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:29:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 16:29:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 16:29:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-03 16:29:56,224 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-12-03 16:29:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:56,225 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-03 16:29:56,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:29:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-03 16:29:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:29:56,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:56,225 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2018-12-03 16:29:56,225 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:56,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2018-12-03 16:29:56,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:56,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:56,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:56,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-03 16:29:58,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:58,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:58,073 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:58,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:58,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:58,073 INFO L192 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 [2018-12-03 16:29:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:58,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:58,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:58,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:58,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-03 16:29:58,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-03 16:30:03,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:03,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:30:03,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:03,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:30:03,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:30:03,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:30:03,669 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-03 16:30:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:04,231 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2018-12-03 16:30:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:30:04,232 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 16:30:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:04,233 INFO L225 Difference]: With dead ends: 217 [2018-12-03 16:30:04,233 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 16:30:04,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:30:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 16:30:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 16:30:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 16:30:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 16:30:04,237 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-12-03 16:30:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:04,237 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 16:30:04,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:30:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 16:30:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:30:04,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:04,238 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2018-12-03 16:30:04,238 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:04,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2018-12-03 16:30:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:04,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:04,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-03 16:30:06,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:06,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:06,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:06,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:06,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:06,393 INFO L192 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 [2018-12-03 16:30:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:06,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:06,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-03 16:30:06,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-03 16:30:12,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:12,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:30:12,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:12,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:30:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:30:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:30:12,099 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-03 16:30:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:12,552 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-03 16:30:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:30:12,552 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 16:30:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:12,553 INFO L225 Difference]: With dead ends: 220 [2018-12-03 16:30:12,554 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:30:12,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:30:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:30:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 16:30:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:30:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 16:30:12,558 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 16:30:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:12,558 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 16:30:12,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:30:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 16:30:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:30:12,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:12,560 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2018-12-03 16:30:12,560 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:12,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:12,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2018-12-03 16:30:12,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:12,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:12,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:12,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-03 16:30:14,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:14,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:14,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:14,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:14,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:14,528 INFO L192 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 [2018-12-03 16:30:14,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:14,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:17,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:30:17,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:17,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-03 16:30:17,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-03 16:30:23,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:23,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:30:23,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:23,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:30:23,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:30:23,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:30:23,216 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-03 16:30:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:23,868 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2018-12-03 16:30:23,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:30:23,868 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 16:30:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:23,869 INFO L225 Difference]: With dead ends: 223 [2018-12-03 16:30:23,869 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:30:23,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:30:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:30:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 16:30:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 16:30:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-03 16:30:23,873 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-03 16:30:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:23,873 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-03 16:30:23,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:30:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-03 16:30:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:30:23,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:23,874 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2018-12-03 16:30:23,875 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:23,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2018-12-03 16:30:23,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:23,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:23,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:23,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:23,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-03 16:30:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:25,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:25,937 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:25,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:25,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:25,937 INFO L192 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 [2018-12-03 16:30:25,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:25,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:26,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:26,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:26,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-03 16:30:26,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-03 16:30:32,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:32,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:30:32,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:32,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:30:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:30:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:30:32,331 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-03 16:30:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:32,914 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-12-03 16:30:32,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:30:32,914 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 16:30:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:32,915 INFO L225 Difference]: With dead ends: 226 [2018-12-03 16:30:32,915 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:30:32,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:30:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:30:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:30:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:30:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 16:30:32,919 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-12-03 16:30:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:32,919 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 16:30:32,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:30:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 16:30:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:30:32,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:32,921 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2018-12-03 16:30:32,921 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:32,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2018-12-03 16:30:32,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:32,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:32,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:32,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:32,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-03 16:30:34,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:34,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:34,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:34,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:34,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:34,999 INFO L192 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 [2018-12-03 16:30:35,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:35,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:35,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-03 16:30:35,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-03 16:30:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:30:41,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:41,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:30:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:30:41,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:30:41,379 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-03 16:30:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:42,035 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2018-12-03 16:30:42,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:30:42,036 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 16:30:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:42,036 INFO L225 Difference]: With dead ends: 229 [2018-12-03 16:30:42,036 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 16:30:42,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:30:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 16:30:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 16:30:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 16:30:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 16:30:42,040 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 16:30:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:42,041 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 16:30:42,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:30:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 16:30:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:30:42,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:42,042 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2018-12-03 16:30:42,042 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:42,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:42,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2018-12-03 16:30:42,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:42,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:42,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:42,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-03 16:30:44,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:44,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:44,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:44,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:44,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:44,186 INFO L192 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 [2018-12-03 16:30:44,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:44,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:46,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:30:46,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:46,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-03 16:30:46,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-03 16:30:53,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:53,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:30:53,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:53,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:30:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:30:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:30:53,103 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-03 16:30:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:53,730 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2018-12-03 16:30:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:30:53,730 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-03 16:30:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:53,731 INFO L225 Difference]: With dead ends: 232 [2018-12-03 16:30:53,731 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:30:53,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:30:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:30:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 16:30:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 16:30:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-03 16:30:53,735 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-03 16:30:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:53,735 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-03 16:30:53,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:30:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-03 16:30:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:30:53,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:53,736 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2018-12-03 16:30:53,736 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:53,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2018-12-03 16:30:53,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:53,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:53,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-03 16:30:55,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:55,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:55,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:55,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:55,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:55,940 INFO L192 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 [2018-12-03 16:30:55,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:55,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:56,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:56,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:56,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:56,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-03 16:30:56,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-03 16:31:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:31:02,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:02,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:31:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:31:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:31:02,744 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-03 16:31:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:03,522 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-03 16:31:03,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:31:03,522 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 16:31:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:03,523 INFO L225 Difference]: With dead ends: 235 [2018-12-03 16:31:03,523 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 16:31:03,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:31:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 16:31:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 16:31:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 16:31:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 16:31:03,527 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-03 16:31:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:03,528 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 16:31:03,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:31:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 16:31:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:31:03,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:03,528 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2018-12-03 16:31:03,529 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:03,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2018-12-03 16:31:03,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:03,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:03,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-03 16:31:05,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:05,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:05,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:05,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:05,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:05,763 INFO L192 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 [2018-12-03 16:31:05,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:05,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:05,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-03 16:31:05,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-03 16:31:12,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:12,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:31:12,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:12,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:31:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:31:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:31:12,751 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-03 16:31:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:13,378 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-12-03 16:31:13,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:31:13,378 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 16:31:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:13,379 INFO L225 Difference]: With dead ends: 238 [2018-12-03 16:31:13,379 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:31:13,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:31:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:31:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 16:31:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 16:31:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 16:31:13,383 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 16:31:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:13,383 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 16:31:13,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:31:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 16:31:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:31:13,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:13,384 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2018-12-03 16:31:13,385 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:13,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2018-12-03 16:31:13,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:13,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-03 16:31:15,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:15,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:15,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:15,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:15,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:15,625 INFO L192 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 [2018-12-03 16:31:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:15,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:20,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:31:20,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:20,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-03 16:31:20,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-03 16:31:27,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:27,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:31:27,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:27,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:31:27,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:31:27,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:31:27,320 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-03 16:31:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:28,134 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-12-03 16:31:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:31:28,134 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 16:31:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:28,135 INFO L225 Difference]: With dead ends: 241 [2018-12-03 16:31:28,135 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:31:28,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:31:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:31:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 16:31:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:31:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-03 16:31:28,140 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-12-03 16:31:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:28,140 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-03 16:31:28,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:31:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-03 16:31:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 16:31:28,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:28,141 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2018-12-03 16:31:28,141 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:28,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:28,142 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2018-12-03 16:31:28,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:28,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:28,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:28,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-03 16:31:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:30,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:30,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:30,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:30,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:30,452 INFO L192 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 [2018-12-03 16:31:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:30,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:30,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:30,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:30,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-03 16:31:30,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-03 16:31:37,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:31:37,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:37,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:31:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:31:37,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:31:37,580 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-03 16:31:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:38,530 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2018-12-03 16:31:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:31:38,530 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 16:31:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:38,531 INFO L225 Difference]: With dead ends: 244 [2018-12-03 16:31:38,531 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:31:38,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:31:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:31:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 16:31:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 16:31:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 16:31:38,536 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-03 16:31:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:38,536 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 16:31:38,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:31:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 16:31:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:31:38,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:38,537 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2018-12-03 16:31:38,537 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:38,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2018-12-03 16:31:38,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:38,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:38,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-03 16:31:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:40,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:40,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:40,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:40,876 INFO L192 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 [2018-12-03 16:31:40,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:40,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:41,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-03 16:31:41,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-03 16:31:48,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:48,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:31:48,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:48,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:31:48,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:31:48,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:31:48,214 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-12-03 16:31:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:49,132 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2018-12-03 16:31:49,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:31:49,132 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-03 16:31:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:49,133 INFO L225 Difference]: With dead ends: 247 [2018-12-03 16:31:49,133 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 16:31:49,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:31:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 16:31:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 16:31:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:31:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 16:31:49,136 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 16:31:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:49,137 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 16:31:49,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:31:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 16:31:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 16:31:49,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:49,138 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2018-12-03 16:31:49,138 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:49,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2018-12-03 16:31:49,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:49,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:49,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:49,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-03 16:31:51,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:51,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:51,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:51,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:51,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:51,555 INFO L192 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 [2018-12-03 16:31:51,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:51,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:54,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:31:54,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:54,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-03 16:31:55,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-03 16:32:02,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:02,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 16:32:02,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:02,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 16:32:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 16:32:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:32:02,227 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-12-03 16:32:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:03,119 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-03 16:32:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:32:03,119 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-12-03 16:32:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:03,120 INFO L225 Difference]: With dead ends: 250 [2018-12-03 16:32:03,120 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:32:03,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:32:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:32:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 16:32:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 16:32:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-12-03 16:32:03,123 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-12-03 16:32:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:03,123 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-12-03 16:32:03,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 16:32:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-12-03 16:32:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 16:32:03,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:03,124 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2018-12-03 16:32:03,125 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:03,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2018-12-03 16:32:03,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:03,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:03,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:03,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-03 16:32:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:05,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:05,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:05,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:05,810 INFO L192 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 [2018-12-03 16:32:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:05,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:05,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:05,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:05,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-03 16:32:05,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-03 16:32:13,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 16:32:13,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:13,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:32:13,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:32:13,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:32:13,514 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-12-03 16:32:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:14,290 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-12-03 16:32:14,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:32:14,290 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-03 16:32:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:14,291 INFO L225 Difference]: With dead ends: 253 [2018-12-03 16:32:14,291 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 16:32:14,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 16:32:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 16:32:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 16:32:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 16:32:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 16:32:14,294 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-12-03 16:32:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:14,295 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 16:32:14,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:32:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 16:32:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 16:32:14,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:14,295 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2018-12-03 16:32:14,296 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:14,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2018-12-03 16:32:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:14,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:14,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:14,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:14,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-03 16:32:16,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:16,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:16,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:16,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:16,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:16,816 INFO L192 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 [2018-12-03 16:32:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:16,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:16,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-03 16:32:16,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-03 16:32:24,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:24,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 16:32:24,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:24,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:32:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:32:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:32:24,905 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-12-03 16:32:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:25,828 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2018-12-03 16:32:25,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:32:25,829 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-03 16:32:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:25,829 INFO L225 Difference]: With dead ends: 256 [2018-12-03 16:32:25,829 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:32:25,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 16:32:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:32:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 16:32:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 16:32:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 16:32:25,833 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 16:32:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:25,833 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 16:32:25,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:32:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 16:32:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 16:32:25,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:25,834 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2018-12-03 16:32:25,834 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:25,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:25,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2018-12-03 16:32:25,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:25,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:25,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:25,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:25,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-03 16:32:28,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:28,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:28,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:28,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:28,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:28,497 INFO L192 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 [2018-12-03 16:32:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:28,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:38,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:32:38,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:38,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-03 16:32:38,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-03 16:32:46,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:46,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 16:32:46,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:46,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:32:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:32:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:32:46,414 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-12-03 16:32:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:47,450 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2018-12-03 16:32:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:32:47,450 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-03 16:32:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:47,451 INFO L225 Difference]: With dead ends: 259 [2018-12-03 16:32:47,451 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 16:32:47,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:32:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 16:32:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 16:32:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 16:32:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-03 16:32:47,455 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-03 16:32:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:47,455 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-03 16:32:47,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:32:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-03 16:32:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 16:32:47,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:47,456 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2018-12-03 16:32:47,456 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:47,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2018-12-03 16:32:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:47,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:47,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-03 16:32:50,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:50,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:50,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:50,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:50,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:50,478 INFO L192 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 [2018-12-03 16:32:50,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:50,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:50,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:50,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:50,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-03 16:32:50,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-03 16:32:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:58,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 16:32:58,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:58,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 16:32:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 16:32:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:32:58,617 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-12-03 16:32:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:59,673 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2018-12-03 16:32:59,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 16:32:59,674 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-03 16:32:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:59,674 INFO L225 Difference]: With dead ends: 262 [2018-12-03 16:32:59,674 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 16:32:59,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 16:32:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 16:32:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 16:32:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:32:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 16:32:59,679 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-12-03 16:32:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:59,679 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 16:32:59,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 16:32:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 16:32:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:32:59,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:59,681 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2018-12-03 16:32:59,682 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:59,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2018-12-03 16:32:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:59,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:59,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-03 16:33:02,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:02,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:02,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:02,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:02,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:02,497 INFO L192 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 [2018-12-03 16:33:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:02,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:02,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-03 16:33:02,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-03 16:33:10,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:10,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 16:33:10,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:10,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:33:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:33:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:33:10,952 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-12-03 16:33:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:11,998 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-03 16:33:11,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:33:11,998 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-03 16:33:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:11,999 INFO L225 Difference]: With dead ends: 265 [2018-12-03 16:33:11,999 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 16:33:12,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 16:33:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 16:33:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-03 16:33:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 16:33:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 16:33:12,003 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 16:33:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:12,004 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 16:33:12,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:33:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 16:33:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 16:33:12,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:12,005 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2018-12-03 16:33:12,005 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:12,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2018-12-03 16:33:12,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:12,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:12,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-03 16:33:14,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:14,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:14,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:14,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:14,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:14,766 INFO L192 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 [2018-12-03 16:33:14,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:14,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:24,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:33:24,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:24,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-03 16:33:24,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-03 16:33:33,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:33,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 16:33:33,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:33,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 16:33:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 16:33:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:33:33,390 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-12-03 16:33:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:34,282 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2018-12-03 16:33:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 16:33:34,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-12-03 16:33:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:34,284 INFO L225 Difference]: With dead ends: 268 [2018-12-03 16:33:34,284 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:33:34,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:33:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:33:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 16:33:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 16:33:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-03 16:33:34,289 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-03 16:33:34,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:34,289 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-03 16:33:34,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 16:33:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-03 16:33:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 16:33:34,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:34,290 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2018-12-03 16:33:34,290 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:34,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2018-12-03 16:33:34,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:34,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:34,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:34,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:34,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-03 16:33:37,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:37,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:37,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:37,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:37,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:37,417 INFO L192 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 [2018-12-03 16:33:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:37,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:37,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:37,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:37,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-03 16:33:37,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-03 16:33:46,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:46,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 16:33:46,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:46,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:33:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:33:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:33:46,325 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-12-03 16:33:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:47,473 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-12-03 16:33:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:33:47,473 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-03 16:33:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:47,474 INFO L225 Difference]: With dead ends: 271 [2018-12-03 16:33:47,474 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:33:47,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 16:33:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:33:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 16:33:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 16:33:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 16:33:47,478 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-03 16:33:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:47,478 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 16:33:47,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:33:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 16:33:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 16:33:47,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:47,479 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2018-12-03 16:33:47,479 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:47,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2018-12-03 16:33:47,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:47,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:47,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-03 16:33:50,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:50,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:50,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:50,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:50,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:50,303 INFO L192 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 [2018-12-03 16:33:50,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:50,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:50,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-03 16:33:50,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-03 16:33:59,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:59,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 16:33:59,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:59,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 16:33:59,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 16:33:59,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:33:59,509 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-12-03 16:34:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:00,433 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2018-12-03 16:34:00,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 16:34:00,433 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-03 16:34:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:00,434 INFO L225 Difference]: With dead ends: 274 [2018-12-03 16:34:00,434 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 16:34:00,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 16:34:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 16:34:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 16:34:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 16:34:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-03 16:34:00,438 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-03 16:34:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:00,438 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-03 16:34:00,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 16:34:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-03 16:34:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 16:34:00,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:00,439 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2018-12-03 16:34:00,439 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:00,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2018-12-03 16:34:00,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:00,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:00,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:00,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-03 16:34:03,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:03,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:03,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:03,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:03,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:03,824 INFO L192 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 [2018-12-03 16:34:03,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:03,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:09,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:34:09,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:09,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-03 16:34:09,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-03 16:34:18,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:18,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 16:34:18,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:18,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:34:18,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:34:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:34:18,260 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-12-03 16:34:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:19,163 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2018-12-03 16:34:19,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:34:19,164 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-12-03 16:34:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:19,164 INFO L225 Difference]: With dead ends: 277 [2018-12-03 16:34:19,165 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 16:34:19,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:34:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 16:34:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-03 16:34:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 16:34:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-03 16:34:19,169 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-12-03 16:34:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:19,169 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-03 16:34:19,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:34:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-03 16:34:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 16:34:19,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:19,170 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2018-12-03 16:34:19,171 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:19,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2018-12-03 16:34:19,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:19,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:19,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:19,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-03 16:34:22,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:22,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:22,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:22,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:22,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:22,595 INFO L192 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 [2018-12-03 16:34:22,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:22,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:22,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:22,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:22,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-03 16:34:22,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-03 16:34:32,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:32,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 16:34:32,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:32,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:34:32,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:34:32,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:34:32,146 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-12-03 16:34:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:33,141 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-03 16:34:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:34:33,141 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-12-03 16:34:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:33,142 INFO L225 Difference]: With dead ends: 280 [2018-12-03 16:34:33,142 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 16:34:33,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 16:34:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 16:34:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 16:34:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 16:34:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 16:34:33,148 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-03 16:34:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:33,148 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 16:34:33,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:34:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 16:34:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 16:34:33,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:33,149 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2018-12-03 16:34:33,149 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:33,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2018-12-03 16:34:33,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:33,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:33,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:33,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:33,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-03 16:34:36,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:36,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:36,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:36,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:36,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:36,260 INFO L192 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 [2018-12-03 16:34:36,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:36,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:36,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-03 16:34:36,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-03 16:34:45,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:45,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 16:34:45,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:45,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:34:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:34:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:34:45,977 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-12-03 16:34:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:47,282 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2018-12-03 16:34:47,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:34:47,282 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-12-03 16:34:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:47,283 INFO L225 Difference]: With dead ends: 283 [2018-12-03 16:34:47,283 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 16:34:47,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 16:34:47,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 16:34:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 16:34:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 16:34:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 16:34:47,287 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 16:34:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:47,288 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 16:34:47,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:34:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 16:34:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 16:34:47,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:47,289 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2018-12-03 16:34:47,289 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:47,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2018-12-03 16:34:47,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:47,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:47,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:47,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-03 16:34:50,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:50,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:50,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:50,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:50,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:50,550 INFO L192 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 [2018-12-03 16:34:50,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:50,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:56,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:34:56,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:56,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-03 16:34:56,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-03 16:35:06,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:06,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 16:35:06,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:06,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 16:35:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 16:35:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:35:06,128 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-12-03 16:35:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:07,275 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-12-03 16:35:07,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:35:07,276 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-12-03 16:35:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:07,276 INFO L225 Difference]: With dead ends: 286 [2018-12-03 16:35:07,276 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 16:35:07,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:35:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 16:35:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 16:35:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 16:35:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-12-03 16:35:07,281 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-12-03 16:35:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:07,281 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-12-03 16:35:07,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 16:35:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-12-03 16:35:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 16:35:07,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:07,282 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2018-12-03 16:35:07,282 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:07,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2018-12-03 16:35:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:07,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:07,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:07,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-03 16:35:10,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:10,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:10,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:10,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:10,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:10,726 INFO L192 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 [2018-12-03 16:35:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:35:10,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:35:10,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:35:10,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:10,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-03 16:35:10,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-03 16:35:20,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:20,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 16:35:20,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:35:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:35:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:35:20,738 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-12-03 16:35:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:22,201 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2018-12-03 16:35:22,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:35:22,202 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-12-03 16:35:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:22,202 INFO L225 Difference]: With dead ends: 289 [2018-12-03 16:35:22,202 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 16:35:22,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 16:35:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 16:35:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 16:35:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 16:35:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 16:35:22,206 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-12-03 16:35:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:22,206 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 16:35:22,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:35:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 16:35:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 16:35:22,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:22,207 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2018-12-03 16:35:22,208 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:22,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2018-12-03 16:35:22,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:22,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:22,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:22,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-03 16:35:25,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:25,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:25,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:25,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:25,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:25,698 INFO L192 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 [2018-12-03 16:35:25,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:25,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:25,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-03 16:35:25,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-03 16:35:35,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:35,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 16:35:35,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:35,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:35:35,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:35:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:35:35,890 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-12-03 16:35:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:37,370 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-12-03 16:35:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:35:37,370 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-12-03 16:35:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:37,371 INFO L225 Difference]: With dead ends: 292 [2018-12-03 16:35:37,371 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 16:35:37,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 16:35:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 16:35:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 16:35:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 16:35:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 16:35:37,375 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 16:35:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:37,375 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 16:35:37,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:35:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 16:35:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 16:35:37,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:37,376 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2018-12-03 16:35:37,376 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:37,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2018-12-03 16:35:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:37,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:37,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-03 16:35:40,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:40,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:40,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:40,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:40,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:40,959 INFO L192 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 [2018-12-03 16:35:40,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:40,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:47,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:35:47,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:47,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-03 16:35:47,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-03 16:35:57,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:57,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 16:35:57,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:57,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:35:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:35:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:35:57,763 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-12-03 16:35:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:59,410 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-03 16:35:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:35:59,411 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-12-03 16:35:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:59,412 INFO L225 Difference]: With dead ends: 295 [2018-12-03 16:35:59,412 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 16:35:59,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:35:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 16:35:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-03 16:35:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 16:35:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-03 16:35:59,416 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-03 16:35:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:59,417 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-03 16:35:59,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:35:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-03 16:35:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 16:35:59,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:59,418 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2018-12-03 16:35:59,418 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:59,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2018-12-03 16:35:59,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:59,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:59,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-03 16:36:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:02,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:02,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:02,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:02,993 INFO L192 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 [2018-12-03 16:36:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:36:03,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:36:03,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:36:03,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:03,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-03 16:36:03,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-03 16:36:13,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:13,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 16:36:13,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:13,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 16:36:13,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 16:36:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:36:13,547 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-12-03 16:36:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:15,193 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-12-03 16:36:15,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 16:36:15,193 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-12-03 16:36:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:15,194 INFO L225 Difference]: With dead ends: 298 [2018-12-03 16:36:15,194 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 16:36:15,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 16:36:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 16:36:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 16:36:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 16:36:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-03 16:36:15,198 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-12-03 16:36:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:15,198 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-03 16:36:15,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 16:36:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-03 16:36:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 16:36:15,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:15,199 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2018-12-03 16:36:15,199 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:15,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:15,200 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2018-12-03 16:36:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:15,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:15,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:15,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-03 16:36:18,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:18,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:18,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:18,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:18,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:18,825 INFO L192 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 [2018-12-03 16:36:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:18,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:36:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:18,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-03 16:36:19,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-03 16:36:29,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:29,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 16:36:29,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:29,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:36:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:36:29,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:36:29,765 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-12-03 16:36:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:31,022 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-12-03 16:36:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:36:31,022 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-12-03 16:36:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:31,023 INFO L225 Difference]: With dead ends: 301 [2018-12-03 16:36:31,023 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 16:36:31,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 16:36:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 16:36:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-03 16:36:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 16:36:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-03 16:36:31,027 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-03 16:36:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:31,027 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-03 16:36:31,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:36:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-03 16:36:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 16:36:31,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:31,028 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2018-12-03 16:36:31,028 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:31,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2018-12-03 16:36:31,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:31,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:31,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:31,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-03 16:36:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:35,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:35,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:35,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:35,079 INFO L192 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 [2018-12-03 16:36:35,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:35,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:50,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:36:50,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:50,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-03 16:36:50,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-03 16:37:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 16:37:01,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:01,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:37:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:37:01,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:37:01,613 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-12-03 16:37:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:03,407 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2018-12-03 16:37:03,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:37:03,407 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-12-03 16:37:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:03,408 INFO L225 Difference]: With dead ends: 304 [2018-12-03 16:37:03,408 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 16:37:03,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:37:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 16:37:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 16:37:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 16:37:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-03 16:37:03,412 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-03 16:37:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:03,412 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-03 16:37:03,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:37:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-03 16:37:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 16:37:03,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:03,413 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2018-12-03 16:37:03,413 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:03,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:03,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2018-12-03 16:37:03,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:03,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:03,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:03,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:03,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 16:37:07,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:07,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:07,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:07,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:07,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:07,380 INFO L192 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 [2018-12-03 16:37:07,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:37:07,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:37:07,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:37:07,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:37:07,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 16:37:07,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 16:37:18,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:18,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 16:37:18,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:18,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:37:18,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:37:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:37:18,590 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-12-03 16:37:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:20,406 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2018-12-03 16:37:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:37:20,406 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-12-03 16:37:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:20,407 INFO L225 Difference]: With dead ends: 307 [2018-12-03 16:37:20,407 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 16:37:20,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 16:37:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 16:37:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 16:37:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 16:37:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-03 16:37:20,411 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-03 16:37:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:20,411 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-03 16:37:20,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:37:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-03 16:37:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 16:37:20,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:20,412 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2018-12-03 16:37:20,412 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:20,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2018-12-03 16:37:20,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:20,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:37:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:20,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-03 16:37:24,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:24,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:24,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:24,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:24,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:24,388 INFO L192 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 [2018-12-03 16:37:24,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:24,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:37:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:24,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:37:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-03 16:37:24,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:37:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-03 16:37:36,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:37:36,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 16:37:36,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:37:36,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 16:37:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 16:37:36,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:37:36,102 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-12-03 16:37:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:37:37,972 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-03 16:37:37,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 16:37:37,973 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-12-03 16:37:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:37:37,974 INFO L225 Difference]: With dead ends: 310 [2018-12-03 16:37:37,974 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 16:37:37,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 16:37:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 16:37:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-03 16:37:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 16:37:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-03 16:37:37,979 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-03 16:37:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:37:37,980 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-03 16:37:37,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 16:37:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-03 16:37:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 16:37:37,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:37:37,981 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2018-12-03 16:37:37,981 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:37:37,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:37:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2018-12-03 16:37:37,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:37:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:37:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:37:37,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:37:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:37:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-03 16:37:42,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:42,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:37:42,070 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:37:42,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:37:42,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:37:42,070 INFO L192 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 [2018-12-03 16:37:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:37:42,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:38:02,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:38:02,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:02,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-03 16:38:02,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-03 16:38:14,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:14,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 16:38:14,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:14,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:38:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:38:14,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:38:14,121 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-12-03 16:38:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:16,253 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2018-12-03 16:38:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:38:16,254 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-12-03 16:38:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:16,255 INFO L225 Difference]: With dead ends: 313 [2018-12-03 16:38:16,255 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 16:38:16,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:38:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 16:38:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-03 16:38:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 16:38:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-03 16:38:16,261 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-12-03 16:38:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:16,261 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-03 16:38:16,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:38:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-03 16:38:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 16:38:16,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:16,262 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2018-12-03 16:38:16,262 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:16,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2018-12-03 16:38:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:16,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:16,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:16,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-03 16:38:20,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:20,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:20,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:20,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:20,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:20,380 INFO L192 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 [2018-12-03 16:38:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:38:20,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:38:20,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:38:20,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:38:20,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-03 16:38:20,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-03 16:38:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 16:38:32,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:32,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:38:32,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:38:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:38:32,636 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-12-03 16:38:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:38:34,258 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-12-03 16:38:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:38:34,259 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-12-03 16:38:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:38:34,259 INFO L225 Difference]: With dead ends: 316 [2018-12-03 16:38:34,260 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 16:38:34,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 16:38:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 16:38:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 16:38:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 16:38:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-03 16:38:34,265 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-03 16:38:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:38:34,265 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-03 16:38:34,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:38:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-03 16:38:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 16:38:34,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:38:34,266 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2018-12-03 16:38:34,267 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:38:34,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:38:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2018-12-03 16:38:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:38:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:34,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:38:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:38:34,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:38:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-03 16:38:38,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:38:38,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:38:38,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:38:38,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:38:38,431 INFO L192 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 [2018-12-03 16:38:38,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:38:38,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:38:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:38:38,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:38:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-03 16:38:38,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:38:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-03 16:38:50,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:38:50,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:38:50,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:38:50,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:38:50,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:38:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:38:50,588 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states.